Spectral conditions for some graphical properties
From MaRDI portal
Publication:526290
DOI10.1016/J.LAA.2017.03.006zbMath1361.05074OpenAlexW2592697101MaRDI QIDQ526290
Publication date: 10 May 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.03.006
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (11)
An improvement of spectral conditions for Hamilton-connected graphs ⋮ Some spectral sufficient conditions for a graph being pancyclic ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Spectral results on Hamiltonian problem ⋮ Some sufficient conditions on \(k\)-connected graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree ⋮ Analyzing lattice networks through substructures ⋮ Spectral radius and the 2-power of Hamilton cycle
Cites Work
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Best monotone degree conditions for graph properties: a survey
- Spectral radii of graphs with given chromatic number
- Spectral radius of graphs with given matching number
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- Signless Laplacian spectral radius and Hamiltonicity
- Eigenvalues and edge-connectivity of regular graphs
- A bound on the spectral radius of graphs
- On n-Hamiltonian graphs
- A method in graph theory
- Eigenvalues and perfect matchings
- On the spectral radius of graphs with cut vertices
- Hamilton cycles and eigenvalues of graphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- On the spectral radius of graphs with a given domination number
- On bags and bugs
- On Hamilton's ideals
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Sufficient degree conditions fork-edge-connectedness of a graph
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Spectral Radius and Degree Sequence
- On three conjectures involving the signless Laplacian spectral radius of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Spectral radius and Hamiltonian properties of graphs
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- Spectral radius and traceability of connected claw-free graphs
- A note on K-path hamiltonian graphs
- Spectral radius and Hamiltonicity of graphs
- The spectral radius of edge chromatic critical graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Spectral conditions for some graphical properties
