Distance signless Laplacian spectral radius for the existence of path-factors in graphs

DOI10.1007/s00010-024-01075-zzbMATH Open1547.05187MaRDI QIDQ6562884

Hongxia Liu, Si-zhong Zhou, Zhi-ren Sun

Publication date: 27 June 2024

Published in: Aequationes Mathematicae (Search for Journal in Brave)

zbMATH Keywords

distance signless Laplacian spectral radiuspath-factors

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Component factors with large components in graphs
• Matchings in regular graphs from eigenvalues
• An extension of Tutte's 1-factor theorem
• Eigenvalues and perfect matchings
• On the spectrum of an equitable quotient matrix and its application
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• Spectral radius and matchings in graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Two sufficient conditions for odd \([1,b\)-factors in graphs]
• Some sufficient conditions for path-factor uniform graphs
• On the distance signless Laplacian of a graph
• Spectral conditions for graphs to be β-deficient involving minimum degree
• The existence of path-factor uniform graphs with large connectivity
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Isolated toughness and path-factor uniform graphs. II.
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Path-factor critical covered graphs and path-factor uniform graphs
• The \(A_\alpha\)-spectral radius for path-factors in graphs
• Remarks on restricted fractional \((g, f)\)-factors in graphs

Related Items (9)

Sufficient conditions for a graph \(kG\) admitting all \([1, k\)-factors] ⋮ Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs ⋮ Independence number and minimum degree for path-factor critical uniform graphs ⋮ A spectral condition for a graph to have strong parity factors ⋮ Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs ⋮ Characterizing spanning trees via the size or the spectral radius of graphs ⋮ A spectral condition for component factors in graphs ⋮ Degree conditions for path-factors in graphs ⋮ An odd \([1, b\)-factor in a graph from signless Laplacian spectral radius]

This page was built for publication: Distance signless Laplacian spectral radius for the existence of path-factors in graphs