Signless Laplacian eigenvalues and circumference of graphs

DOI10.1016/j.dam.2013.01.013zbMath1287.05086OpenAlexW2038084944MaRDI QIDQ2446343

Francesco Belardo, Jianfeng Wang

Publication date: 16 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.01.013

zbMATH Keywords

circumferenceHamiltonicitysignless Laplaciangraph spectrum\(Q\)-matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)

Related Items (6)

Matching number, Hamiltonian graphs and magnetic Laplacian matrices ⋮ Graphs with at most one signless Laplacian eigenvalue exceeding three ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ On the signless Laplacian index and radius of graphs ⋮ The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number

Cites Work

• Unnamed Item
• Spectral radius and Hamiltonian graphs
• A note on the signless Laplacian eigenvalues of graphs
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Signless Laplacians of finite graphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Signless Laplacian spectral radius and Hamiltonicity
• A domain monotonicity theorem for graphs and Hamiltonicity
• Advances on the Hamiltonian problem -- a survey
• Graphs with fourth Laplacian eigenvalue less than two
• Enumeration of cospectral graphs.
• On graphs with at most three Laplacian eigenvalues greater than or equal to two.
• Graphs characterized by Laplacian eigenvalues
• On graphs with small number of Laplacian eigenvalues greater than two
• Hamilton cycles and eigenvalues of graphs
• Nonsingular mixed graphs with few eigenvalues greater than two
• The Laplacian Spectrum of a Graph
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• Sparse pseudo‐random graphs are Hamiltonian
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Spectral radius and Hamiltonicity of graphs
• A relation between the matching number and Laplacian spectrum of a graph

This page was built for publication: Signless Laplacian eigenvalues and circumference of graphs