Spectral radius and fractional [a, b]-factor of graphs
From MaRDI portal
Publication:6994746
Cites work
- A sharp upper bound of the spectral radius of graphs
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Eigenvalues and [a,b]‐factors in regular graphs
- Fractional (g,f)-factors of graphs
- Graph Factors and Matching Extensions
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1117461 (Why is no real title available?)
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
- On the spectral radius of graphs with cut edges
- Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Simplified existence theorems for \((g,f)\)-factors
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral radius and \([a,b]\)-factors in graphs
- Spectral radius and fractional perfect matchings in graphs
- Spectral radius conditions for fractional \([a,b]\)-covered graphs
- Spectral radius, fractional $[a,b]$-factor and ID-factor-critical graphs
- Sufficient conditions for graphs to have (g,f)-factors
Cited in
(3)
This page was built for publication: Spectral radius and fractional \([a, b]\)-factor of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994746)