Some results on vulnerability parameters and Wiener-type indices
From MaRDI portal
Publication:6611073
DOI10.1016/J.DAM.2024.07.016zbMATH Open1547.05057MaRDI QIDQ6611073
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Eulerian and Hamiltonian graphs (05C45) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some sufficient conditions for Hamiltonian property in terms of Wiener-type invariants
- Best monotone degree conditions for binding number
- Wiener index and Harary index on Hamilton-connected graphs with large minimum degree
- On sufficient topological indices conditions for properties of graphs
- Wiener index, Harary index and graph properties
- Tough graphs and Hamiltonian circuits.
- Wiener-type invariants and \(k\)-leaf-connected graphs
- Toughness and Vertex Degrees
- The binding number of a graph and its Anderson number
- Wiener-type invariants and Hamiltonian properties of graphs
- Wiener index and vulnerability parameters of graphs
- On sufficient conditions for Hamiltonicity of graphs, and beyond
- Some sufficient conditions for graphs to be \(k\)-leaf-connected
This page was built for publication: Some results on vulnerability parameters and Wiener-type indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611073)