Solution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs

[摘要] Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Linear Algebra Appl. 436(12):4512-1829, 2012] showed that the spectral radius of $G^\sigma$ is the same for every orientation $\sigma$ of $G$, and equals the maximum m

[学科分类] 离散数学和组合数学

[关键词] skew spectral radius;odd-cycle graphs;maximum matching root;Kelmans transformation