| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418546 | Discrete Applied Mathematics | 2011 | 9 Pages |
Abstract
The Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated.
► We deal with a specific class of interchange graphs. ► Explicit algebraic formulas for the Wiener number are given. ► Some properties such as cliques and distance-related properties are investigated.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jingjing Jin,