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