Spectral conditions for graphs to be -deficient involving minimum degree
DOI10.1080/03081087.2017.1323845zbMATH Open1387.05159OpenAlexW2610262345MaRDI QIDQ4640095FDOQ4640095
Authors: Minmin Liu, Weijun Liu, Lihua Feng
Publication date: 16 May 2018
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2017.1323845
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.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Signless Laplacian spectral radius and Hamiltonicity
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Title not available (Why is that?)
- Matchings in regular graphs from eigenvalues
- On the spectral radius of graphs with cut vertices
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Note on the HOMO-LUMO index of graphs
- A pair of forbidden subgraphs and perfect matchings.
- Eigenvalues and perfect matchings
- On bags and bugs
- On the spectral radius of graphs with a given domination number
- Regular graphs, eigenvalues and regular factors
- Regular factors and eigenvalues of regular graphs
- Perfect matchings, eigenvalues and expansion
- Large matchings from eigenvalues
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- Eigenvalues and edge-connectivity of regular graphs
- Extremal cacti of given matching number with respect to the distance spectral radius
- Spectral radius of graphs
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectral radii of graphs with given chromatic number
- Spectral radius of graphs with given matching number
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Spectral conditions for some graphical properties
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- Spectral radius and traceability of connected claw-free graphs
- 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
- On deficiency problems for graphs
- Integral Cayley graphs over dicyclic group
- 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)