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

DOI10.1007/S00010-024-01075-ZzbMATH Open1547.05187MaRDI QIDQ6562884FDOQ6562884

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)

Cites Work

• Matchings in regular graphs from eigenvalues
• On the distance signless Laplacian of a graph
• Title not available (Why is that?)
• Eigenvalues and perfect matchings
• Component factors with large components in graphs
• An extension of Tutte's 1-factor theorem
• On the spectrum of an equitable quotient matrix and its application
• Some sufficient conditions for path-factor uniform graphs
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Spectral radius and matchings in graphs
• On path-factor critical deleted (or covered) graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Toughness, isolated toughness and path factors in graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Path factors in subgraphs
• The existence of path-factor uniform graphs with large connectivity
• Isolated toughness and path-factor uniform graphs. II.
• Title not available (Why is that?)
• 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

Cited In (10)

• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
• Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
• 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
• 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
• 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

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