An odd [1, b]-factor in a graph from signless Laplacian spectral radius
From MaRDI portal
Publication:6667372
Recommendations
- Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- Spectral radius and \([a,b]\)-factors in graphs
- Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
Cites work
- 2-factors and independent sets on claw-free graphs
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
- Eigenvalues and \([1,n]\)-odd factors
- Eigenvalues and perfect matchings
- scientific article; zbMATH DE number 7691485 (Why is no real title available?)
- Independence number and minimum degree for path-factor critical uniform graphs
- Isolated toughness and path-factor uniform graphs. II.
- Matchings in regular graphs from eigenvalues
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On factors with all degrees odd
- On path-factor critical deleted (or covered) graphs
- On the spectrum of an equitable quotient matrix and its application
- Path factors and neighborhoods of independent sets in graphs
- Path factors in claw-free graphs
- 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 results on odd factors of graphs
- Some results on path-factor critical avoidable graphs
- Some sufficient conditions for path-factor uniform graphs
- Spectral radius and \([a,b]\)-factors in graphs
- Spectral radius and matchings in graphs
- Stability number and [a,b]‐factors in graphs
- The A_-spectral radius for path-factors in graphs
- Toughness and isolated toughness conditions for path-factor critical covered graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
Cited in
(2)
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)
