On the sum of all distances in a graph or digraph
From MaRDI portal
Publication:3344025
Cited in
(only showing first 100 items - show all)- 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
- Computing the average distance of an interval graph
- On the sum of all distances in composite graphs
- Independence and average distance in graphs
- On the average Steiner distance of graphs with presribed properties
- 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
- Wiener index versus maximum degree in trees
- On Wiener numbers of polygonal nets
- 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
- Mean distance in a tree
- On forwarding indices of networks
- The average connectivity of a digraph
- Superdominance order and distance of trees with bounded maximum degree
- Minimum average distance of strong orientations of graphs
- A Wiener-type graph invariant for some bipartite graphs
- On the total distance between nodes in tournaments
- Wiener index of iterated line graphs of trees homeomorphic to \(H\)
- Wiener index of graphs with radius two
- Some extremal properties of the degree distance of a graph
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
- Graphs with a given diameter that maximise the Wiener index
- On sufficient topological indices conditions for properties of graphs
- On average distance in tournaments and Eulerian digraphs
- 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 proof of a conjecture on maximum Wiener index of oriented ladder graphs
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
- On transmission irregular starlike trees
- Minimal Harary index of unicyclic graphs with diameter at most 4
- An asymptotic resolution of a problem of Plesník
- Wiener index of quadrangulation graphs
- Which numbers are status differences?
- Bicyclic graphs with extremal cover cost
- The Steiner \(k\)-Wiener index of graphs with given minimum degree
- Cospectrality of graphs with respect to distance matrices
- A few examples and counterexamples in spectral graph theory
- On maximum Wiener index of trees and graphs with given radius
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
- Relationship between the edge-Wiener index and the Gutman index of a graph
- 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
- Diameter and inverse degree
- Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers
- Wiener indices of maximal \(k\)-degenerate graphs
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
- The \(k\)-Szeged index of graphs
- 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
- Sizes and transmissions of digraphs with a given clique number
- Directing Road Networks by Listing Strong Orientations
- Ordering the non-starlike trees with large reverse Wiener indices.
- On the lower and upper bounds for different indices of tricyclic graphs
- On thek-ary hypercube tree and its average distance
- Orientations of graphs with maximum Wiener index
- On the average distance of the hypercube tree
- Average distance and vertex-connectivity
- Network design for time-constrained delivery using subgraphs
- scientific article; zbMATH DE number 90560 (Why is no real title available?)
- On a conjecture about Wiener index in iterated line graphs of trees
- scientific article; zbMATH DE number 622027 (Why is no real title available?)
- Light graphs with small routing cost
- More on betweenness-uniform graphs.
- On the total distance and diameter of graphs
- scientific article; zbMATH DE number 912429 (Why is no real title available?)
- Average distance, minimum degree, and spanning trees
- On 2-connected transmission irregular graphs
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- Wiener index in graphs with given minimum degree and maximum degree
- Counting the numbers of paths of all lengths in symmetric dendrimers and its applications
- Extremal Wiener Index of Graphs with Given Number of Vertices of Odd Degree
- Wiener index of graphs with fixed number of pendant or cut-vertices
- Some topological indices and graph properties
- The diameter of strong orientations of strong products of graphs
- On a conjecture about the ratio of Wiener index in iterated line graphs
- New corona and new cluster of graphs and their Wiener index
- Degree distance of unicyclic and bicyclic graphs
- Average distance, independence number, and spanning trees
- Graph theory (algorithmic, algebraic, and metric problems)
- On maximum Wiener index of directed grids
- Graph colourings and partitions
- BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet
- Maximum size of digraphs of given radius
- Continuous mean distance of a weighted graph
- The extremal average distance of cubic graphs
- Extremal total distance of graphs of given radius I
- Average distance, minimum degree, and irregularity index
- On mean distance and girth
This page was built for publication: On the sum of all distances in a graph or digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344025)