Distance distributions for graphs modeling computer networks

Citations of this article
Mendeley users who have this article in their library.


The Wiener polynomial of a graph G is a generating function for the distance distribution dd (G) = (D1, D2, ..., Dt), where Di 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. © 2007 Elsevier B.V. All rights reserved.




Elenbogen, B., & Fink, J. F. (2007). Distance distributions for graphs modeling computer networks. Discrete Applied Mathematics, 155(18), 2612–2624. https://doi.org/10.1016/j.dam.2007.07.020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free