On the sum of all distances in a graph or digraph
From MaRDI portal
Publication:3344025
DOI10.1002/jgt.3190080102zbMath0552.05048OpenAlexW1983321303MaRDI QIDQ3344025
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080102
Related Items (only showing first 100 items - show all)
Wiener index versus maximum degree in trees ⋮ On Wiener numbers of polygonal nets ⋮ Wiener index in graphs with given minimum degree and maximum degree ⋮ Comparing Wiener complexity with eccentric complexity ⋮ Sizes and transmissions of digraphs with a given clique number ⋮ Computing the average distance of an interval graph ⋮ The maximum Wiener index of maximal planar graphs ⋮ On the connectivity and the diameter of betweenness-uniform graphs ⋮ On the lower and upper bounds for different indices of tricyclic graphs ⋮ Ordering the non-starlike trees with large reverse wiener indices ⋮ Minimum average distance of strong orientations of graphs ⋮ Light graphs with small routing cost ⋮ On the sum of all distances in composite graphs ⋮ A proof of a conjecture on maximum Wiener index of oriented ladder graphs ⋮ Orientations of graphs with maximum Wiener index ⋮ A Wiener-type graph invariant for some bipartite graphs ⋮ 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 ⋮ More on betweenness-uniform graphs ⋮ On the total distance between nodes in tournaments ⋮ BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet ⋮ Average distance and domination number ⋮ Extremal values for ratios of distances in trees ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Wiener number of hexagonal jagged-rectangles ⋮ Upper bounds for the \(M D\)-numbers and characterization of extremal graphs ⋮ ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS ⋮ Average distance, minimum degree, and spanning trees ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index ⋮ On mean distance and girth ⋮ On transmission irregular starlike trees ⋮ Minimal Harary index of unicyclic graphs with diameter at most 4 ⋮ Network design for time-constrained delivery using subgraphs ⋮ The \(k\)-Szeged index of graphs ⋮ On the revised Szeged index ⋮ Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs ⋮ On a conjecture about Wiener index in iterated line graphs of trees ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ New composition of graphs and their Wiener indices ⋮ Wiener index of iterated line graphs of trees homeomorphic to \(H\) ⋮ An asymptotic resolution of a problem of Plesník ⋮ A measure for a balanced workload and its extremal values ⋮ Wiener index of graphs with radius two ⋮ Relationship between the edge-Wiener index and the Gutman index of a graph ⋮ Some extremal properties of the degree distance of a graph ⋮ Wiener index of quadrangulation graphs ⋮ Extremal properties of reciprocal complementary Wiener number of trees ⋮ On the sum of all distances in bipartite graphs ⋮ Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees ⋮ Average distance in weighted graphs ⋮ Spanning trees: A survey ⋮ Sum of weighted distances in trees ⋮ Maximum external Wiener index of graphs ⋮ An upper bound on Wiener indices of maximal planar graphs ⋮ Digraphs with large maximum Wiener index ⋮ Some remarks on Wiener index of oriented graphs ⋮ An inequality between the edge-Wiener index and the Wiener index of a graph ⋮ Open quipus with the same Wiener index as their quadratic line graph ⋮ From ternary strings to Wiener indices of benzenoid chains ⋮ Which numbers are status differences? ⋮ Bicyclic graphs with extremal cover cost ⋮ Diameter and inverse degree ⋮ On the average distance of the hypercube tree ⋮ On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs ⋮ Degree distance of unicyclic and bicyclic graphs ⋮ Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers ⋮ On ordinary and reverse Wiener indices of non-caterpillars ⋮ Graphs with a given diameter that maximise the Wiener index ⋮ Average distance and generalised packing in graphs ⋮ The Wiener index in iterated line graphs ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ On sufficient topological indices conditions for properties of graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Wiener index, Harary index and graph properties ⋮ Proof of a conjecture on the Wiener index of Eulerian graphs ⋮ Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ Size of graphs and digraphs with given diameter and connectivity constraints ⋮ A few examples and counterexamples in spectral graph theory ⋮ On 2-Connected Transmission Irregular Graphs ⋮ Directing Road Networks by Listing Strong Orientations ⋮ Mean distance in a tree ⋮ Unnamed Item ⋮ A generalization of Sperner's theorem and an application to graph orientations ⋮ On reciprocal complementary Wiener number ⋮ Average distances and distance domination numbers ⋮ Four new sums of graphs and their Wiener indices ⋮ On forwarding indices of networks ⋮ On thek-ary hypercube tree and its average distance ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Average distance and vertex-connectivity ⋮ The average connectivity of a digraph ⋮ Unnamed Item ⋮ A new method to find the Wiener index of hypergraphs ⋮ Superdominance order and distance of trees with bounded maximum degree
Cites Work
This page was built for publication: On the sum of all distances in a graph or digraph
