Title of article
On the extremal connective eccentricity index among trees with maximum degree
Author/Authors
Hayat, Fazal School of Mathematical Sciences - South China Normal University - Guangzhou, PR China
Pages
8
From page
239
To page
246
Abstract
The connective eccentricity index (CEI) of a graph G is defined as ξce(G)=∑v∈V(G)dG(v)εG(v), where dG(v) is the degree of v and εG(v) is the eccentricity of v. In this paper, we characterize the unique trees with the maximum and minimum CEI among all n-vertex trees and n-vertex conjugated trees with fixed maximum degree, respectively.
Keywords
Connective eccentricity index , Connective eccentricity index , tree , maximum degree , perfect matching
Journal title
Transactions on Combinatorics
Serial Year
2021
Record number
2698144
Link To Document