Spectral conditions for graphs to be -deficient involving minimum degree
From MaRDI portal
Publication:4640095
Recommendations
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Minimum order of a graph with given deficiency and either minimum or maximum degree
- Minimum number of vertices of almost 3-regular graphs with given deficiency
- Spectral conditions of complement for some graphical properties
- Some sufficient conditions for some graph properties.
Cites work
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- A pair of forbidden subgraphs and perfect matchings.
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Eigenvalues and edge-connectivity of regular graphs
- Eigenvalues and perfect matchings
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Extremal cacti of given matching number with respect to the distance spectral radius
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- Note on the HOMO-LUMO index of graphs
- On bags and bugs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- On the spectral radius of graphs with a given domination number
- On the spectral radius of graphs with cut vertices
- Perfect matchings, eigenvalues and expansion
- Regular factors and eigenvalues of regular graphs
- Regular graphs, eigenvalues and regular factors
- Signless Laplacian spectral radius and Hamiltonicity
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectral conditions for some graphical properties
- Spectral radii of graphs with given chromatic number
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Spectral radius and traceability of connected claw-free graphs
- Spectral radius of graphs
- Spectral radius of graphs with given matching number
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- The spectral radius of edge chromatic critical graphs
Cited in
(16)- The \(A_\alpha\)-spectral radius for path-factors in graphs
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
- The \(Q\)-index and connectivity of graphs
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- A note on extremal trees with degree conditions
- Integral Cayley graphs over a certain nonabelian group
- The maximum spectral radius of graphs without friendship subgraphs
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
- Integral Cayley graphs over dicyclic group
- On deficiency problems for graphs
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Matching extension and distance spectral radius
- Integral Cayley graphs over semi-dihedral groups
- The matchings and spectral radius of graphs involving minimum degree
- Minimum order of a graph with given deficiency and either minimum or maximum degree
- Spectral radius and \([a,b]\)-factors in graphs
This page was built for publication: Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640095)
