|
Sibirskii Zhurnal Industrial'noi Matematiki, 2009, Volume 12, Number 4, Pages 44–50
(Mi sjim581)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
The Wiener Index for Graphs of Arbitrary Girth and Their Edge Graphs
A. A. Dobrynin Sobolev Institute of Mathematics, SB RAS, Novosibirsk
Abstract:
We consider the invariant $W(G)$ (Wiener index) of a simple connected nondirected graph $G$, which is equal to the sum of distances between all pairs of vertices in the natural metric. We show that for every $g\ge5$ there exist planar graphs $G$ with a shortest cycle of length $g$ for which $W(L(G))=W(G)$, where $L(G)$ is the edge graph for $G$.
Keywords:
invariant graph, distance in graphs, Wiener index.
Received: 19.02.2009
Citation:
A. A. Dobrynin, “The Wiener Index for Graphs of Arbitrary Girth and Their Edge Graphs”, Sib. Zh. Ind. Mat., 12:4 (2009), 44–50; J. Appl. Industr. Math., 4:4 (2010), 505–511
Linking options:
https://www.mathnet.ru/eng/sjim581 https://www.mathnet.ru/eng/sjim/v12/i4/p44
|
|