| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10678422 | Applied Mathematics Letters | 2005 | 6 Pages |
Abstract
The Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. Infinite families of graphs with increasing cyclomatic number and the property W(G)=W(L(G)) are presented, where L(G) denotes the line graph of G. This gives a positive (partial) answer to an open question posed in an earlier paper by Gutman, JovaÅ¡eviÄ, and Dobrynin.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Andrey A. Dobrynin, Leonid S. Mel'nikov,