On the extremal connective eccentricity index among trees with maximum degree

Publish Year: 1400
نوع سند: مقاله ژورنالی
زبان: English
View: 127

This Paper With 8 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_COMB-10-4_004

تاریخ نمایه سازی: 17 خرداد 1400

Abstract:

The connective eccentricity index (CEI) of a graph G is defined as \xi^{ce}(G)=\sum_{v \in V(G)}\frac{d_G(v)}{\varepsilon_G(v)}, where d_G(v) is the degree of v and \varepsilon_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.

Authors

Fazal Hayat

School of Mathematical Sciences, South China Normal University, Guangzhou ۵۱۰۶۳۱, PR China