Average distance and vertex-connectivity
From MaRDI portal
Publication:3652548
DOI10.1002/jgt.20395zbMath1221.05108OpenAlexW4236466682MaRDI QIDQ3652548
Simon Mukwembi, Peter Dankelmann, Henda C. Swart
Publication date: 18 December 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20395
Related Items (13)
Wiener index in graphs with given minimum degree and maximum degree ⋮ The maximum Wiener index of maximal planar graphs ⋮ Ordering the non-starlike trees with large reverse wiener indices ⋮ Counting the Numbers of Paths of All Lengths in Symmetric Dendrimers and Its Applications ⋮ Upper bounds for the \(M D\)-numbers and characterization of extremal graphs ⋮ The extremal average distance of cubic graphs ⋮ Average distance in weighted graphs ⋮ An upper bound on Wiener indices of maximal planar graphs ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Proof of a conjecture on the Wiener index of Eulerian graphs ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Equal opportunity networks, distance-balanced graphs, and Wiener game ⋮ On the Wiener index of generalized Fibonacci cubes and Lucas cubes
Cites Work
- Unnamed Item
- On the radius of graphs
- Mean distance in a graph
- An upper bound for the radius of a 3-connected graph
- On the sum of all distances in a graph or digraph
- Average Distance and Edge-Connectivity II
- Average Distance and Edge-Connectivity I
- Distance in graphs
- Average distance, minimum degree, and spanning trees
This page was built for publication: Average distance and vertex-connectivity