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

DOI10.2298/YJOR181115010DzbMath1474.05071arXiv1809.03158OpenAlexW2942306438WikidataQ128027225 ScholiaQ128027225MaRDI QIDQ3388428

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

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

extremal graph theorypendant verticeseccentric connectivity index

Mathematics Subject Classification ID

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

Related Items (1)

On the general degree-eccentricity index of a graph

Cites Work

• Unnamed Item
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• Maximum eccentric connectivity index for graphs with given diameter
• On eccentric connectivity index
• Eccentric Connectivity Index of Chemical Trees

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