Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
On a connection between the existence of k-trees and the toughness of a graph
Spanning trees with bounded degrees
Spanning spiders and light-splitting switches
On the spectrum of an equitable quotient matrix and its application
A tight lower bound on the matching number of graphs via Laplacian eigenvalues
Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Some results on path-factor critical avoidable graphs
Path factors in subgraphs
An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
Spectral radius and matchings in graphs
The \(A_\alpha\)-spectral radius and perfect matchings of graphs
Two sufficient conditions for odd \([1,b\)-factors in graphs]
Some sufficient conditions for path-factor uniform graphs
On the distance signless Laplacian spectral radius of graphs
Spectral conditions for graphs to be β-deficient involving minimum degree
Stability number and [a,b‐factors in graphs]
Toughness, trees, and walks
Isolated toughness variant and fractional κ-factor
Isolated toughness for path factors in networks
The spanning k-trees, perfect matchings and spectral radius of graphs
Spanning trees with many leaves
A sufficient condition for a graph to have a \(k\)-tree
Spanning trees with constraints on the leaf degree
Path factors in claw-free graphs
Spectral radius and spanning trees of graphs
Eigenvalues and [a,b‐factors in regular graphs]
Isolated toughness and path-factor uniform graphs. II.
Sun toughness and path-factor uniform graphs
Path-factor critical covered graphs and path-factor uniform graphs
\(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
The \(A_\alpha\)-spectral radius for path-factors in graphs
Remarks on restricted fractional \((g, f)\)-factors in graphs
Distance signless Laplacian spectral radius for the existence of path-factors in graphs

This page was built for publication: Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs

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