Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable

DOI10.7151/dmgt.2127zbMath1431.05100OpenAlexW2810762905MaRDI QIDQ2282471

Minmin Liu, Peng-Li Zhang, Wei-jun Liu, Li-Hua Feng

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2127

zbMATH Keywords

spectral radiusminimum degree\(k\)-Hamiltonian\(k\)-path-coverable

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Some sufficient conditions for graphs being \(k\)-leaf-connected ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree

Cites Work

• Unnamed Item
• Extremal Halin graphs with respect to the signless Laplacian spectra
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Spectral radius and Hamiltonian graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Best monotone degree conditions for graph properties: a survey
• Spectral conditions for some graphical properties
• Complete solution to a conjecture on the maximal energy of unicyclic graphs
• Spectral radius of graphs with given matching number
• On tricyclic graphs of a given diameter with minimal energy
• The spectral radius of graphs without paths and cycles of specified length
• Signless Laplacian spectral radius and Hamiltonicity
• On n-Hamiltonian graphs
• A method in graph theory
• Extremal cacti of given matching number with respect to the distance spectral radius
• Spectral radius and \(k\)-connectedness of a graph
• A sharp upper bound of the spectral radius of graphs
• Wiener index, Harary index and graph properties
• Some sufficient conditions on \(k\)-connected graphs
• On the spectral radius of graphs with a given domination number
• On bags and bugs
• On Hamilton's ideals
• Spectral radius and Hamiltonicity of graphs with large minimum degree
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• On a conjecture about tricyclic graphs with maximal energy
• Some Inequalities for the Largest Eigenvalue of a Graph
• On minimal energies of trees with given diameter
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
• Spectral conditions for graphs to be β-deficient involving minimum degree
• Spectral radius and Hamiltonian properties of graphs
• Wiener-type invariants on graph properties
• The signless Laplacian spectral radius of bounded degree graphs on surfaces
• Spectral radius and traceability of connected claw-free graphs
• Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
• Partitioning a graph into vertex-disjoint paths
• n-Hamiltonian graphs
• Spectral radius and Hamiltonicity of graphs
• The spectral radius of edge chromatic critical graphs

This page was built for publication: Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable