Spectral conditions for some graphical properties
From MaRDI portal
Publication:526290
DOI10.1016/J.LAA.2017.03.006zbMATH Open1361.05074OpenAlexW2592697101MaRDI QIDQ526290FDOQ526290
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) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)
Cites Work
- Signless Laplacian spectral radius and Hamiltonicity
- Hamilton cycles and eigenvalues of graphs
- On Hamilton's ideals
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- 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
- Title not available (Why is that?)
- Spectral radius and Hamiltonicity of graphs
- Matchings in regular graphs from eigenvalues
- On the spectral radius of graphs with cut vertices
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- A bound on the spectral radius of graphs
- Sufficient degree conditions fork-edge-connectedness of a graph
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- A method in graph theory
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Best monotone degree conditions for graph properties: a survey
- Title not available (Why is that?)
- Spectral Radius and Degree Sequence
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Eigenvalues and perfect matchings
- On bags and bugs
- On the spectral radius of graphs with a given domination number
- Large matchings from eigenvalues
- Eigenvalues and edge-connectivity of regular graphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Title not available (Why is that?)
- On n-Hamiltonian graphs
- A note on K-path hamiltonian graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral radii of graphs with given chromatic number
- Spectral radius of graphs with given matching number
- Spectral invariants and some stable properties of a graph.
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- Spectral radius and traceability of connected claw-free graphs
- Title not available (Why is that?)
- The spectral radius of edge chromatic critical graphs
Cited In (14)
- The \(Q\)-index and connectivity of graphs
- Spectral results on Hamiltonian problem
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Analyzing lattice networks through substructures
- Extremal problems on the Hamiltonicity of claw-free graphs
- Some spectral sufficient conditions for a graph being pancyclic
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Spectral conditions for graphs to be β-deficient involving minimum degree
- Spectral radius and \(k\)-connectedness of a graph
- Spectral sufficient conditions for graph factors containing any edge
- Some sufficient conditions on \(k\)-connected graphs
- An improvement of spectral conditions for Hamilton-connected graphs
- Title not available (Why is that?)
- Spectral radius and the 2-power of Hamilton cycle
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)