Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs (Q2341063): Difference between revisions

Summary: Let \(G\) be a simple graph with no even cycle, called an odd-cycle graph. \textit{M. Cavers} et al. [Linear Algebra Appl. 436, No. 12, 4512--4529 (2012; Zbl 1241.05070)] showed that the spectral radius of \(G^\sigma\) is the same for every orientation \(\sigma\) of \(G\), and equals the maximum matching root of \(G\). They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs \(G\) of order \(n\) are isomorphic to the odd-cycle graph with one vertex degree \(n-1\) and size \(m=\lfloor 3(n-1)/2\rfloor\). By using the Kelmans transformation, we give a proof to the conjecture. Moreover, sharp upper bounds of the maximum matching roots of the odd-cycle graphs with given order \(n\) and size \(m\) are given and extremal graphs are characterized.