Distance spectral conditions for \textit{ID}-factor-criticality and fractional [a,b]-factor of graphs
From MaRDI portal
Publication:6883709
Cites work
- A survey on distance spectra of graphs
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
- Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
- Distance spectra of graphs: a survey
- Extremal problems on distance spectra of graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- General factors of graphs
- Graph theory
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Matching extension and distance spectral radius
- On Representatives of Subsets
- On the Addressing Problem for Loop Switching
- On the distance signless Laplacian spectral radius of graphs
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- 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
- Spectral radius and \([a,b]\)-factors in graphs
- Spectral radius and spanning trees of graphs
- Spectral radius, fractional $[a,b]$-factor and ID-factor-critical graphs
- Sufficient conditions for k-factors and spanning trees of graphs
- The 1-Factors of Oriented Graphs
- The Factorization of Linear Graphs
This page was built for publication: Distance spectral conditions for \textit{ID}-factor-criticality 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 Q6883709)