Diameter and inverse degree
From MaRDI portal
Publication:2470432
DOI10.1016/j.disc.2007.07.053zbMath1142.05022OpenAlexW2048110977MaRDI QIDQ2470432
Henda C. Swart, Paul van den Berg, Peter Dankelmann
Publication date: 14 February 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.053
Related Items (17)
Inverse degree, Randic index and harmonic index of graphs ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ A note on diameter and the degree sequence of a graph ⋮ Beyond the Zagreb indices ⋮ On diameter and inverse degree of a graph ⋮ Nordhaus-Gaddum-type results for resistance distance-based graph invariants ⋮ Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ Unnamed Item ⋮ Inverse degree and edge-connectivity ⋮ More on inverse degree and topological indices of graphs ⋮ New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs ⋮ Relations between ordinary and multiplicative degree-based topological indices ⋮ Zagreb indices of graphs ⋮ Some extremal graphs with respect to inverse degree
Uses Software
Cites Work
- Average distance and independence number
- Using minimum degree to bound average distance
- On the sum of all distances in a graph or digraph
- The average distance and the independence number
- Mean distance and minimum degree
- Average distance, minimum degree, and spanning trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Diameter and inverse degree