Distance distributions for graphs modeling computer networks

Authors:
Bruce Elenbogen;John Frederick Fink
Affiliations:
Department of Computer and Information Science, University of Michigan-Dearborn, Dearborn, MI 48128-1491, USA;Department of Mathematics and Statistics, University of Michigan-Dearborn, Dearborn, MI 48128-1491, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 0

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
On some counting polynomials in chemistry

Discrete Applied Mathematics - Applications of Graphs in Chemistry and Physics
Wiener number of vertex-weighted graphs and a chemical application

Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Distances in benzenoid systems: further developments

Proceedings of the conference on Discrete metric spaces

Quantified Score

Hi-index	0.04

Visualization

Abstract

The Wiener polynomial of a graph G is a generating function for the distance distribution dd(G)=(D"1,D"2,...,D"t), where D"i is the number of unordered pairs of distinct vertices at distance i from one another and t is the diameter of G. We use the Wiener polynomial and several related generating functions to obtain generating functions for distance distributions of unweighted and weighted graphs that model certain large classes of computer networks. These provide a straightforward means of computing distance and timing statistics when designing new networks or enlarging existing networks.