Bounds on the General Eccentric Connectivity Index

Xinhong Yu, Muhammad Imran, Aisha Javed, Muhammad Kamran Jamil, Xuewu Zuo

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

The general eccentric connectivity index of a graph R is defined as (Formula presented.), where (Formula presented.) is any real number, (Formula presented.) and (Formula presented.) represent the eccentricity and the degree of the vertex u in R, respectively. In this paper, some bounds on the general eccentric connectivity index are proposed in terms of graph-theoretic parameters, namely, order, radius, independence number, eccentricity, pendent vertices and cut edges. Moreover, extremal graphs are characterized by these bounds.

Original languageEnglish
Article number2560
JournalSymmetry
Volume14
Issue number12
DOIs
Publication statusPublished - Dec 2022

Keywords

  • eccentric connectivity index
  • eccentricity of vertex
  • extremal graphs
  • general eccentric connectivity index

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Chemistry (miscellaneous)
  • General Mathematics
  • Physics and Astronomy (miscellaneous)

Fingerprint

Dive into the research topics of 'Bounds on the General Eccentric Connectivity Index'. Together they form a unique fingerprint.

Cite this