Total Eccentricity of some Graph Operations

Autor:	H. Yousefi-Azari, Khadijeh Fathalikhani, Hamed Faramarzi
Rok vydání:	2014
Předmět:	Discrete mathematics Combinatorics Vertex (graph theory) Circulant graph Edge-transitive graph Graph power Applied Mathematics Neighbourhood (graph theory) Discrete Mathematics and Combinatorics Bound graph Regular graph Distance-regular graph Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 45:125-131
ISSN:	1571-0653
DOI:	10.1016/j.endm.2013.11.025
Popis:	Let G be a simple connected graph. The total eccentricity of a graph G , ζ ( G ) , is defined as ζ ( G ) = ∑ v ∈ V ( G ) e c G ( v ) , where e c G ( v ) of a vertex v ∈ V ( G ) is the maximum distance between v and any other vertex in G. In this paper, the total eccentricity of some graph operations are computed and then a bound for that of tensor product is presented.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c7d6621a2d985ae44a0190592ab2948d https://doi.org/10.1016/j.endm.2013.11.025 Zobrazit plný text záznamu Full Text from ScienceDirect