On the maximum CEI of graphs with paprameters

2019/12/12 by Fazal Hayat, Hayat, Fazal
Chemistry · Computer Science · Mathematics · #05C07 #05C12 #05C35 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.1912.05871

openalex publication_date 2019/12/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The connective eccentricity index (CEI) of a graph G is defined as ξ^ce(G)=∑_{v ∈ V(G)}(d_G(v))/(ε_G(v)), where d_G(v) is the degree of v and ε_G(v) is the eccentricity of v. In this paper, we characterize the unique graphs with maximum CEI from three classes of graphs: the n-vertex graphs with fixed connectivity and diameter, the n-vertex graphs with fixed connectivity and independence number, and the n-vertex graphs with fixed connectivity and minimum degree.

Citations

• Eccentric Connectivity Index: A Novel Highly Discriminating Topological Descriptor for Structure−Property and Structure−Activity Studies

Related

• On the connective eccentricity index of two types of trees
• Total eccentricity index of graphs with fixed number of pendant or cut vertices
• Bounds for eccentricity-based parameters of graphs
• On the extremal properties of the average eccentricity
• Eccentric Connectivity Index of Strongly Connected Digraphs