Comparison Between Second Zagreb Eccentricity Index and Eccentric Connectivity Index of Graphs
Current Trends in Computer Sciences & Applications · 2018
DOI: 10.32474/ctcsa.2018.01.000105 ↗Kurz gefasst
Fachartikel in der Zeitschrift Current Trends in Computer Sciences & Applications, 2018. Verfasst von Kexiang Xu ay.
Abstract (Originalsprache)
Throughout this paper we only consider the finite, undirected, simple and connected graphs. The degree of v ∊ V(G), denoted by degG(v), is the number of vertices in G adjacent to v. For any two vertices u; v in a graph G, the distance between them, denoted by ( , ) G d u v is the length of a shortest path connecting them in G. As usual, let Sn, Pn, Cn, Kn be the star graph, path graph, cycle graph and complete graph, respectively, on n vertices. Other undefined notations and terminology on the graph theory can be found in [1]. For any vertex of graph G, the eccentricity ( ) G v ε (or ( ) v ε for short) is the maximum distance from v to other vertices of G, i.e., ( ) G v ε = maxu≠v ( , ) G d u v . The eccentricity of a vertex is an important parameter in pure graph theory. The radius of a graph G is denoted by r(G) and defined by r = r(G) = {min ( ) v ε | v ∈ V(G)}. Also, the diameter of G, denoted by d(G), is the maximum distance between vertices of a graph G and hence d = d(G) = max{ ( ) v ε | v ∈ V(G)}. A vertex v with ( ) G v ε = r(G) is called a central vertex in G. A graph G with d(G) = r(G) is called a self-centered graph. A graph which contains only two non-central vertices is called almost self-centered graph [2] (ASC graph for short). Moreover, the eccentricity is also applied in chemical graph theory. There are several eccentricity-based topological indices, including the second Zagreb eccentricity index E2(G) [3] and eccentric connectivity index ( ) c G ξ [4], of graphs G where 2 ( ) ( ) ( ) ( ) G G uv E G E G u v ε ε ∈ = ∑ and ( ) ( ) deg ( ) ( ) c G v V G G v v ξ ε ∈ =∑ . In particular, we have ( ) ( ) ( ( ) ( )) c uv E G G u v ξ ε ε ∈ = + ∑ or any graph G. In this paper we prove some comparison results between 2 ( ) E G m and ( ) c G n ξ of connected graphs G of order n with m edges. Main results
Zitieren
APA
ay, K. X. (2018). Comparison Between Second Zagreb Eccentricity Index and Eccentric Connectivity Index of Graphs. Current Trends in Computer Sciences & Applications. https://doi.org/10.32474/ctcsa.2018.01.000105
Vancouver
ay KX. Comparison Between Second Zagreb Eccentricity Index and Eccentric Connectivity Index of Graphs. Current Trends in Computer Sciences & Applications. 2018. doi:10.32474/ctcsa.2018.01.000105
BibTeX
@article{ay2018,
author = {ay, Kexiang Xu},
title = {Comparison Between Second Zagreb Eccentricity Index and Eccentric Connectivity Index of Graphs},
journal = {Current Trends in Computer Sciences & Applications},
year = {2018},
doi = {10.32474/ctcsa.2018.01.000105}
}
EUVIMED