Spectral radius and rainbow Hamilton paths of a graph

DOI10.1016/J.DISC.2024.114128MaRDI QIDQ6570051zbMATH OpenFDO

Authors Xiaocong He, Yongtao Li, Lihua Feng

Publication date 10 July 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114128

zbMATH Keywords

extremal graph theorylinear forestsrainbow Hamilton pathspectral radius

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Recommendations

• Spectral radius and rainbow matchings of graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• Spectral conditions for rainbow matchings of bipartite graphs
• Spectral radius and Hamiltonicity of graphs with large minimum degree.

Cites work

• A better bound on the size of rainbow matchings
• A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
• A rainbow version of Mantel's theorem
• Bounds on graph eigenvalues. II
• Counting substructures and eigenvalues. I: Triangles
• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a conjecture of spectral extremal problems
• On a conjecture of V. Nikiforov
• On a rainbow version of Dirac's theorem
• On maximal paths and circuits of graphs
• On the size of graphs with complete-factors
• Signless Laplacian spectral radius and Hamiltonicity
• Spectra of graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Spectral radius and rainbow matchings of graphs
• Spectral radius of graphs with given matching number
• Spectral results on Hamiltonian problem
• The formula for Turán number of spanning linear forests
• The generalized Turán number of spanning linear forests
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• The maximum spectral radius of graphs without spanning linear forests
• The shifting method and generalized Turán number of matchings
• The size of a hypergraph and its matching number
• The spectral radius of trees on \(k\) pendant vertices
• Three conjectures in extremal spectral graph theory

Cited in

(6)

• Signless Laplacian spectral conditions for the existence of rainbow k-factors in a collection of graphs
• Spectral radius and rainbow k-factors of graphs
• Rainbow Hamiltonicity and the spectral radius
• Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
• Spectral radius and rainbow Hamiltonicity in bipartite graphs
• Spectral radius, transversal Hamilton paths and cycles in bipartite graph families

This page was built for publication: Spectral radius and rainbow Hamilton paths of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570051)