An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius

Cites Work

Title not available (Why is that?)
2-factors and independent sets on claw-free graphs
Eigenvalues and \([1,n\)-odd factors]
Matchings in regular graphs from eigenvalues
On factors with all degrees odd
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
Some results on path-factor critical avoidable graphs
Spectral radius and \([a,b\)-factors in graphs]
On path-factor critical deleted (or covered) graphs
An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
Spectral radius and matchings in graphs
Perfect matching and distance spectral radius in graphs and bipartite graphs
Some sufficient conditions for path-factor uniform graphs
On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
Towards a spectral theory of graphs based on the signless Laplacian, I
Some results on odd factors of graphs
Stability number and [a,b‐factors in graphs]
Path factors in claw-free graphs
Toughness and isolated toughness conditions for path-factor critical covered graphs
Path factors and neighborhoods of independent sets in graphs
Isolated toughness and path-factor uniform graphs. II.
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
Independence number and minimum degree for path-factor critical uniform graphs

This page was built for publication: An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius

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