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

DOI10.1007/S00010-024-01075-ZMaRDI QIDQ6562884zbMATH OpenFDO

Authors Sizhong Zhou, Zhiren Sun, Hongxia Liu

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

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

Recommendations

• Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index
• Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
• An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius

Cites work

• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• scientific article; zbMATH DE number 7691485 (Why is no real title available?)
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• An extension of Tutte's 1-factor theorem
• Component factors with large components in graphs
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Eigenvalues and perfect matchings
• Isolated toughness and path-factor uniform graphs. II.
• Matchings in regular graphs from eigenvalues
• On path-factor critical deleted (or covered) graphs
• On the distance signless Laplacian of a graph
• On the spectrum of an equitable quotient matrix and its application
• Path factors in subgraphs
• Path-factor critical covered graphs and path-factor uniform graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Remarks on restricted fractional \((g, f)\)-factors in graphs
• Some sufficient conditions for path-factor uniform graphs
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• Spectral radius and matchings in graphs
• The \(A_\alpha\)-spectral radius for path-factors in graphs
• The existence of path-factor uniform graphs with large connectivity
• Toughness, isolated toughness and path factors in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs

Cited in

(11)

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

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

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