Some results on the Wiener index of iterated line graphs

Autor:	Andrey A. Dobrynin, Leonid S. Mel'nikov
Rok vydání:	2005
Předmět:	Discrete mathematics Applied Mathematics Mathematical properties Wiener index Distance-regular graph law.invention Combinatorics Vertex-transitive graph Graph power law Iterated function Line graph Discrete Mathematics and Combinatorics Bound graph Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 22:469-475
ISSN:	1571-0653
DOI:	10.1016/j.endm.2005.06.081
Popis:	The Wiener index W ( G ) of a graph G is the sum of distances between all unordered pairs of vertices. This notion was motivated by various mathematical properties and chemical applications. For a tree T, it is known that W ( T ) and W ( L ( T ) ) are always distinct. It is shown that there is an infinite family of trees with W ( T ) = W ( L 2 ( T ) ) .
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e3e0e8b67dd09a0d8e5b8646eb3e9bb2 https://doi.org/10.1016/j.endm.2005.06.081 Zobrazit plný text záznamu Full Text from ScienceDirect