Research Article  Open Access
The Wiener Index of Circulant Graphs
Abstract
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. In this paper, we discuss the relation of the Wiener index and the Harary index of circulant graphs and the largest eigenvalues of distance matrix and reciprocal distance matrix of circulants. We obtain the following consequence: ; ; , where W, H denote the Wiener index and the Harary index and λ, μ denote the largest eigenvalues of distance matrix and reciprocal distance matrix of circulant graphs, respectively. Moreover we also discuss the Wiener index of nonregular graphs with cut edges.
1. Introduction
A circulant graph is a graph whose adjacency matrix (with respect to a suitable vertex indexing) can be constructed from its first row by a process of continued rotation of entries. The interest of circulant graphs in graph theory and applications has grown during the last two decades; they appeared in coding theory, VLSI design, Ramsey theory, and other areas. Recently there is vast research on the interconnection schemes based on circulant topology. Circulant graphs represent an important class of interconnection networks in parallel and distributed computing [1].
We consider simple graphs. Let be a connected graph with the vertexset . The distance matrix of is an matrix such that is just the distance (i.e., the number of edges of a shortest path) between the vertices and in . The reciprocal distance matrix of is also called the Harary matrix [2].
For , denotes the set of its neighbors in . Let and be, respectively, the maximum eigenvalues of and ; the distance spectral radius of is the largest eigenvalue . Ivanciuc et al. [3] proposed to use the maximum eigenvalues of distancebased matrices as structural descriptors; they have shown that and are able to produce fair QSPR models for the boiling points, molar heat capacities, vaporization enthalpies, refractive indices, and densities for C_{6}–C_{10} alkanes.
Recall the Hosoya definition of the Wiener index [4] and the Harary index:
Since the distance matrix and related matrices, based on graphtheoretical distance, are rich sources of many graph invariants (topological indices) that have been found to be used in structurepropertyactivity modeling [5], it is of interest to study spectra and polynomials of these matrices.
The Harary index, , of a molecular graph with vertices is based on the concept of reciprocal distance and is defined, in parallel with the Wiener index, as the halfsum of the offdiagonal elements of the reciprocal molecular distance matrix :
The reciprocal distance matrix can be simply obtained by replacing all offdiagonal elements of the distance matrix by their reciprocals: It should be noted that diagonal elements are all equal to zero by definition. This matrix was first mentioned by Balaban et al. [6]. The maximum eigenvalues of various matrices have recently attracted attention of mathematical chemists [6–8].
The Harary index and the related indices such as its extension to heterosystems [7] and the hyperHarary index [8] have shown a modest success in structureproperty correlations [9], but the use of these indices in combination with other descriptors appears to be very efficacious in improving the QSPR (quantitative structureproperty relationship) models.
The paper is organized as follows. In Section 2 we bring forward an interesting phenomenon. In Section 3, we analyze the cause of this phenomenon to emerge; we report our results for the maximum eigenvalues of the Wiener matrix and the Harary matrix of circulant graphs. Finally, in Section 4, we discuss the Wiener index of nonregular graphs.
2. An Interesting Phenomenon
Recall that, for a positive integer and set , the circulant graph is the graph with vertices, labeled with integers modulo , such that each vertex is adjacent to other vertices . The set is called a symbol of . As we will consider only undirected graphs without loops, we assume that and if and only if , and therefore the vertex is adjacent to vertices for each . In other words, a graph is circulant if it is Cayley graph on the circulant group; that is, its adjacency matrix is circulant.
For any circulant graph , it is a regular graph. A circulant graph is called regular of degree (or valency) , when every vertex has precisely neighbors. Let denote the diameter of ; then is less than the number of distinct eigenvalues of the adjacency matrix of (see [10]).
Now, consider 4circulant graphs with vertices, respectively. By a straightforward mathematical calculation, we obtain some data on the Wiener index: , the Harary index: , and the eigenvalues: , of the Wiener matrix and the Harary matrix as follows in Table 1.

From Table 1, it is easy to observe that and are equal. Moreover, we have and .
We again observe Table 2.

From Table 2, we also obtain the same results previously when the number of vertices is fixed in .
Why does this phenomenon occur? We will be interested in trying to explain something about this phenomenon. To prove our result, we need a few more lemmas.
Lemma 1 (see [11]). Let be an nonnegative irreducible symmetric matrix with row sums . If is the maximum eigenvalue of , then with either equality if and only if or there is a permutation matrix such that where all the row sums of are equal.
Lemma 2 (see [12]). Let be a rregular graph of order . If are the adjacency eigenvalues of , then its Deigenvalues are and , where Deigenvalues denote the eigenvalues of the distance matrix .
Lemma 3 (see [13]). Let be a rcirculant graph on vertices and the Wiener index of ; then the following equality holds: where denotes the number of edges.
Lemma 4 (see [14]). Let be a component of and . If , where is adjacent to in , let be obtained by removing an edge of and add a new edge . For all , if a vertex satisfies , then , where denotes the distance between a pair of vertices in .
3. Main Results
In this section, we will prove the following two theorems.
Theorem 5. Let be a rcirculant graph on vertices; then the following equality holds:
Proof. Obviously, and are irreducible for . By Lemma 1, we have Note that is a regular graph of degree ; hence all the row sums of and are equal, respectively; that is, , ; then we have On the other hand, according to definitions of the Wiener index and the Harary index, we have Thus we obtain
Theorem 6. Let be a rcirculant graph on vertices; then its Wiener index and Harary index listed below have the following relationship:
Proof. Since a circulant graph is a regular graph, applying Lemma 2, we get its maximum distance matrix eigenvalue:
For regular graphs on vertices the following equality holds:
and we denote by the number of edges of . According to (6) and (14) we have
That is, . By (13) and (15), we have
On the other hand, Indulal proved the following fact in [15].
Fact. Let be a graph with Wiener index . Then and the equality holds if and only if is distance regular.
Then, from (16) and the previous fact, we have .
By equality (11), we obtain . This completes the proof of the theorem.
4. Nonregular Graphs
As we just said, for a regular, those conclusions above hold. But for nonregular graph, it is not easy to tell whether or not the conclusions also hold.
For arbitrary tree on vertices, It is proved that (see [16]) with equality on the left if and only if and equality on the right if and only if , where is the path and is the star on vertices.
Without loss of generality, we now discuss the Wiener index of graph ; it is obtained by joining pendent edges to a vertex of complete graph .
It is well known that the Wiener index of has a direct proportion with the distance spectral radius of as vertices fixed; that is, the distance spectral radius of is strictly increasing with the Wiener index increasing [15]. Then we show the following theorem.
Theorem 7. Let be a simple connected graph on vertices and cut edges; then .
Proof. We will use the above well known fact to prove , with equality if and only if .
Let be set of cut edges; assume any block of has a clique. If , then , and the proposition holds.
Now suppose that ; let denote the components of , respectively, where .
Let .
Claim 1 (, ). In fact, if , such that , let , and . Let . Obviously, is a disconnected graph on vertices and cut edges, and . Due to in by Lemma 4, we have , and then we reach a contradiction.
Without loss of generality, assume .
Claim 2. If is adjacent to , , then or .
In fact, if and .
Let denote two components containing in , respectively, and .
Let . Then still is a connected graph with vertices and cut edges, and , where is a pendent edge in . Using Lemma 4, we have , and this leads to a contradiction.
Since is connected, according to Claims 1 and 2, we obtain . Hence we have .
This completes the proof of the theorem.
Conflict of Interests
The author declares that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The author is grateful to the reviewers for their valuable comments and suggestions. Project is supported by Hunan Provincial Natural Science Foundation of China no. 13JJ3118.
References
 F. K. Hwang, “A survey on multiloop networks,” Theoretical Computer Science, vol. 299, no. 1–3, pp. 107–121, 2003. View at: Publisher Site  Google Scholar
 D. Janezic, A. Milicevic, S. Nikolic, and N. Trinajstic, GraphTheoretical Matrices in Chemistry, Mathematical Chemistry Monographs, No. 3, University of Kragujevac, Kragujevac, Serbia, 2007.
 O. Ivanciuc, T. Ivanciuc, and A. T. Balaban, “Quantitative structureproperty relation ship evaluation of structural descriptors derived from the distance and reverse Wiener matrices,” Internet Electronic Journal of Molecular Design, vol. 1, pp. 467–487, 2002. View at: Google Scholar
 H. Hosoya, “Topological index,” Bulletin of the Chemical Society of Japan, vol. 44, no. 9, pp. 2332–2339, 1971. View at: Publisher Site  Google Scholar
 J. Devillers and A. T. Balaban, Topological Indices and Related Descriptors in QSAR and QSPR, Gordon and Breach, Amsterdam, The Netherlands, 1999.
 T. S. Balaban, P. A. Filip, and O. Ivanciuc, “Computer generation of acyclic graphs based on local vertex invariants and topological indices. Derived canonical labelling and coding of trees and alkanes,” Journal of Mathematical Chemistry, vol. 11, no. 1, pp. 79–105, 1992. View at: Publisher Site  Google Scholar
 O. Ivanciuc, T. Ivanciuc, and A. T. Balaban, “Design of topological indices. Part 10.1. Parameters based on electronegativity and covalent radius for the computation of molecular graph descriptors for heteroatomcontaining molecules,” Journal of Chemical Information and Computer Sciences, vol. 38, no. 3, pp. 395–401, 1998. View at: Google Scholar
 M. V. Diudea, “Indices of reciprocal properties or Harary indices,” Journal of Chemical Information and Computer Sciences, vol. 37, no. 2, pp. 292–299, 1997. View at: Google Scholar
 R. Todeschini and V. Consonni, Handbook of Molecular Descriptors, WileyVCH, Weinheim, Germany, 2000.
 L. Hogben, “Spectral graph theory and the inverse eigenvalue problem of a graph,” Electronic Journal of Linear Algebra, vol. 14, pp. 12–31, 2005. View at: Google Scholar
 Z. Bo, “On the Spectral radius of nonnegative matrices,” Australasian Journal of Combinatorics, vol. 22, pp. 301–306, 2000. View at: Google Scholar
 G. Indulal, I. Gutman, and A. Vijayakumar, “On distance energy of graphs,” Match, vol. 60, no. 2, pp. 461–472, 2008. View at: Google Scholar
 L. Xiaoxia, “On the extremal Wiener indices of some graphs,” OR Transactions, vol. 14, no. 2, pp. 55–60, 2010. View at: Google Scholar
 S. N. Ruzieh, “The distance spectrum of the path ${P}_{n}$ and the first distance eigenvector of conneeted graph,” Linear Algebra and Its Applications, vol. 281, pp. 75–81, 1990. View at: Google Scholar
 G. Indulal, “Sharp bounds on the distance spectral radius and the distance energy of graphs,” Linear Algebra and Its Applications, vol. 430, no. 1, pp. 106–113, 2009. View at: Publisher Site  Google Scholar
 R. C. Entringer, D. E. Jackson, and D. A. Snyder, “Distance in graphs,” Czechoslovak Mathematical Journal, vol. 26, pp. 283–296, 1976. View at: Google Scholar
Copyright
Copyright © 2014 Houqing Zhou. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.