Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant

DOI10.2298/YJOR181115010DMaRDI QIDQ3388428zbMATH OpenOpenAlexWikidataFDO

Authors Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele

Publication date 5 May 2021

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.03158

zbMATH Keywords

eccentric connectivity indexextremal graph theorypendant vertices

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Connectivity (05C40) Applications of graph theory (05C90)

Abstract: The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_G(v)e_G(v)$, where $d_G(v)$ is the degree of $v$ in $G$ and $e_G(v)$ is the maximum distance between $v$ and any other vertex of $G$. This index is helpful for the prediction of biological activities of diverse nature, a molecule being modeled as a graph where atoms are represented by vertices and chemical bonds by edges. We characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order $n$. Also, given two integers $n$ and $p$ with $pleqn-1$, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order $n$ with $p$ pending vertices.

Recommendations

• On connective eccentricity index of graphs
• On the extremal eccentric connectivity index of graphs
• On the minimal eccentric connectivity indices of graphs
• On the eccentric connectivity index and Wiener index of a graph
• On the eccentric connectivity index of a graph

Cites work

• Eccentric Connectivity Index of Chemical Trees
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• scientific article; zbMATH DE number 1890136 (Why is no real title available?)
• Maximum eccentric connectivity index for graphs with given diameter
• On eccentric connectivity index

Cited in

(2)

• Total eccentricity index of graphs with fixed number of pendant or cut vertices
• On the general degree-eccentricity index of a graph

This page was built for publication: Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant

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