Mean distance in a graph

DOI10.1016/0012-365X(77)90144-3zbMath0361.05045MaRDI QIDQ1239331

John Kevin Doyle, Jack E. Graver

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (50)

Wiener index versus maximum degree in trees ⋮ On maximum Wiener index of directed grids ⋮ Computing the average distance of an interval graph ⋮ On the sum of all distances in composite graphs ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Proximity in triangulations and quadrangulations ⋮ Sphere theorems with and without smoothing ⋮ Orientations of graphs with maximum Wiener index ⋮ Independence and average distance in graphs ⋮ The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees ⋮ On the average Steiner distance of graphs with presribed properties ⋮ Wiener indices of maximal \(k\)-degenerate graphs ⋮ BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet ⋮ Wiener index of graphs with fixed number of pendant or cut-vertices ⋮ Average distance and domination number ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Average distance, minimum degree, and spanning trees ⋮ Counterexamples to the conjecture on orientations of graphs with minimum Wiener index ⋮ On mean distance and girth ⋮ Continuous mean distance of a weighted graph ⋮ Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs ⋮ Average distance, minimum degree, and irregularity index ⋮ Mean distance on metric graphs ⋮ Unnamed Item ⋮ Average distance in weighted graphs ⋮ An upper bound on Wiener indices of maximal planar graphs ⋮ Digraphs with large maximum Wiener index ⋮ The average order of dominating sets of a graph ⋮ Some remarks on Wiener index of oriented graphs ⋮ Average distance is submultiplicative and subadditive with respect to the strong product of graphs ⋮ The \(\rho\)-moments of vertex-weighted graphs ⋮ On the average distance of the hypercube tree ⋮ On exact solution approaches for the longest induced path problem ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Connections between Wiener index and matchings ⋮ Cospectrality of graphs with respect to distance matrices ⋮ On a conjecture about the ratio of Wiener index in iterated line graphs ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ Mean distance in a tree ⋮ On thek-ary hypercube tree and its average distance ⋮ On the transmission-based graph topological indices ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Average distance and vertex-connectivity ⋮ Average Distance, Independence Number, and Spanning Trees ⋮ A new method to find the Wiener index of hypergraphs ⋮ On the average number of nodes in a subtree of a tree ⋮ On the average order of a dominating set of a forest ⋮ Monotonicity of the mean order of subtrees ⋮ Hosoya polynomials and Wiener indices of carbon nanotubes using mathematica programming

This page was built for publication: Mean distance in a graph