Spectral conditions for some graphical properties
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6119656 (Why is no real title available?)
- scientific article; zbMATH DE number 6288910 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A bound on the spectral radius of graphs
- A method in graph theory
- A note on K-path hamiltonian graphs
- Best monotone degree conditions for graph properties: a survey
- 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, edge connectivity, and eigenvalues in graphs
- Eigenvalues and edge-connectivity of regular graphs
- Eigenvalues and perfect matchings
- Hamilton cycles and eigenvalues of graphs
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- Note on the HOMO-LUMO index of graphs
- On Hamilton's ideals
- On bags and bugs
- On n-Hamiltonian graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the spectral radius of graphs with a given domination number
- On the spectral radius of graphs with cut vertices
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Signless Laplacian spectral radius and Hamiltonicity
- Spectral Radius and Degree Sequence
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Spectral invariants and some stable properties of a graph.
- 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 degree conditions for \(k\)-edge-connectedness of a graph
- 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
(14)- Spectral radius and the 2-power of Hamilton cycle
- An improvement of spectral conditions for Hamilton-connected graphs
- Spectral radius and \(k\)-connectedness of a graph
- Extremal problems on the Hamiltonicity of claw-free graphs
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Spectral sufficient conditions for graph factors containing any edge
- scientific article; zbMATH DE number 6288910 (Why is no real title available?)
- Analyzing lattice networks through substructures
- Some sufficient conditions on \(k\)-connected graphs
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- The \(Q\)-index and connectivity of graphs
- Some spectral sufficient conditions for a graph being pancyclic
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Spectral results on Hamiltonian problem
This page was built for publication: Spectral conditions for some graphical properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526290)
