5 February 2016 in Linear and Multilinear Algebra
In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper, we present the spectral analogues of Erdős’ theorem and Moon–Moser’s theorem, respectively. Let be the class of non-Hamiltonian graphs of order n and minimum degree at least k. We determine the maximum (signless Laplacian) spectral radius of graphs in (for large enough n), and the minimum (signless Laplacian) spectral radius of the complements of graphs in . All extremal graphs with the maximum (signless Laplacian) spectral radius and with the minimum (signless Laplacian) spectral radius of the complements are determined, respectively. We also solve similar problems for balanced bipartite graphs and the quasi-complements.
28 September 2020 in Combinatorics, Probability and Computing
Bollobás and Nikiforov (J. Combin. Theory Ser. B.97 (2007) 859–865) conjectured the following. If G is a Kr+1-free graph on at least r+1 vertices and m edges, then ${\rm{\lambda }}_1^2(G) + {\rm{\lambda }}_2^2(G) \le (r - 1)/r \cdot 2m$ , where λ1 (G)and λ2 (G) are the largest and the second largest eigenvalues of the adjacency matrix A(G), respectively. In this paper we confirm the conjecture in the case r=2, by using tools from doubly stochastic matrix theory, and also characterize all families of extremal graphs. Motivated by classic theorems due to Erdös and Nosal respectively, we prove that every non-bipartite graph of order and size contains a triangle if one of the following is true: (i) ${{\rm{\lambda }}_1}(G) \ge \sqrt {m - 1} $ and $G \ne {C_5} \cup (n - 5){K_1}$ , and (ii) ${{\rm{\lambda }}_1}(G) \ge {{\rm{\lambda }}_1}(S({K_{[(n - 1)/2],[(n - 1)/2]}}))$ and $G \ne S({K_{[(n - 1)/2],[(n - 1)/2]}})$ , where $S({K_{[(n - 1)/2],[(n - 1)/2]}})$ is obtained from ${K_{[(n - 1)/2],[(n - 1)/2]}}$ by subdividing an edge. Both conditions are best possible. We conclude this paper with some open problems.
2 March 2021 in Journal of Graph Theory
3 August 2014 in Linear and Multilinear Algebra
Let be a graph with minimum degree . The spectral radius of , denoted by , is the largest eigenvalue of the adjacency matrix of . In this note, we mainly prove the following two results.
1 February 2014 in European Journal of Combinatorics
16 January 2020 in Combinatorica