On the maximum CEI of graphs with paprameters

arXiv1912.05871MaRDI QIDQ6330977FDOQ6330977

Authors: Fazal Hayat 

Publication date: 12 December 2019

Abstract: The connective eccentricity index (CEI) of a graph $G$ is defined as $x{i}^{ce}(G)=su{m}_{vinV(G)}frac{d}_G(v)varepsilo{n}_G(v)$, where $d_G(v)$ is the degree of $v$ and $varepsilo{n}_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.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12)

This page was built for publication: On the maximum CEI of graphs with paprameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330977)