Distance signless Laplacian spectral radius for the existence of path-factors in graphs
Let \(G\) be a finite graph of order \(n\) with the vertex set \(\{v_1,v_2,\ldots,v_n\}\) and let \(F\) be a spanning subgraph of \(G\). Then, \(F\) is called a path factor if every component of \(F\) is a path of order at least 2. A \(P_{\geq k}\)-factor means a path factor in which every component admits order at least \(k (k \geq 2)\). Let \(Q(G)\) denote the distance signless Laplacian matrix of \(G\) and \(\eta_1(G)\) denote the spectral radius of \(Q(G)\). In this article, the authors present a distance signless Laplacian spectral radius condition to guarantee the existence of a \(P_{\geq 2}\)-factor in a graph \(G\). In this direction, for a connected graph \(G\) of order \(n\geq 4\), the authors prove the following:\N\begin{itemize}\N\item \(G\) admits a \(P_{\geq 2}\)-factor for \(n\neq7\) if \(\eta_1(G) < \theta(n)\), where \(\theta(n)\) is the largest root of the equation \N\[\Nx^3 - (5n - 3)x^2 + (8n^2 - 23n + 48)x- 4n^3 + 22n^2 - 74n + 80 = 0;\N\]\N\item \(G\) admits a \(P_{\geq 2}\)-factor for \(n=7\) if \(\eta_1(G) < \frac{25+\sqrt{161}}{2}\).\N\end{itemize}
- 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
- 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 {P2, P5}-factor in a graph
- Eigenvalues and perfect matchings
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 7691485 (Why is no real title available?)
- 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_-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
- Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
- Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index
- 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
- Distance signless Laplacian spectra of graphs: a survey
- The path-factors and generalized distance spectral radius of graphs
- Spanning subgraphs and spectral radius in graphs
- Some sufficient conditions for graphs to have component factors
- A spectral condition for the existence of component factors in graphs
- A distance spectral radius for star-factors with large components in graphs
- Toughness, fractional extendability and distance spectral radius in graphs
- Spectral conditions for component factors in graphs involving minimum degree
- Some spectral conditions for star-factors in bipartite graphs
- Laplacian eigenvalue condition for a graph to have the strong parity property
- Sufficient conditions for a graph with minimum degree to be \(k\)-critical with respect to an odd \([1,b]\)-factor
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)
