Some sufficient conditions on k-connected graphs
From MaRDI portal
Publication:2279253
Recommendations
- New sufficient spectral conditions on \(k\)-edge-connected graph
- Spectral radius and \(k\)-connectedness of a graph
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- Improved sufficient conditions for \(k\)-leaf-connected graphs
- Connectivity and spectral radius of graphs.
Cites work
- scientific article; zbMATH DE number 6282153 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- Best monotone degree conditions for graph properties: a survey
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Graph theory
- Harary index and Hamiltonian property of graphs
- Harary index and some Hamiltonian properties of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the distance signless Laplacian spectral radius of graphs
- On the extremal Wiener polarity index of trees with a given diameter
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Signless Laplacian spectral radius and Hamiltonicity
- Some observations on Harary index and traceable graphs
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Spectral conditions for some graphical properties
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and traceability of connected claw-free graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- The maximum Wiener polarity index of unicyclic graphs
- Wiener index and traceable graphs
- Wiener index on traceable and Hamiltonian graphs
- Wiener index, Harary index and Hamiltonicity of graphs
- Wiener index, Harary index and graph properties
- Wiener polarity index and its generalization in trees
Cited in
(11)- Connectivity and spectral radius of graphs.
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
- New sufficient spectral conditions on \(k\)-edge-connected graph
- On the normalized Laplacian spectral radius of traceable graphs
- New sufficient conditions on \(k\)-path-coverable graphs
- Improved sufficient conditions for \(k\)-leaf-connected graphs
- Some sufficient conditions for some graph properties.
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- The \(Q\)-index and connectivity of graphs
- Sufficient conditions for \(k\)-restricted edge connected graphs
This page was built for publication: Some sufficient conditions on \(k\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279253)