Extremal bounds on peripherality measures

DOI10.47443/DML.2023.148MaRDI QIDQ6128977zbMATH OpenOpenAlexFDO

Authors

Publication date 16 April 2024

Published in Discrete Mathematics Letters (Search for Journal in Brave)

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

zbMATH Keywords

centralityirregularityMostar indexperipheralitysum peripheralityTrinajstić index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Chemical graph theory (05C92)

Abstract: We investigate several measures of peripherality for vertices and edges in networks. We improve asymptotic bounds on the maximum value achieved by edge peripherality, edge sum peripherality, and the Trinajsti'c index over $n$ vertex graphs. We also prove similar results on the maxima over $n$-vertex bipartite graphs, trees, and graphs with a fixed diameter. Finally, we refute two conjectures of Furtula, the first on necessary conditions for minimizing the Trinajsti'c index and the second about maximizing the Trinajsti'c index.

Recommendations

• Peripherality in networks: theory and applications
• On the peripheral Wiener index of graphs
• Mostar index
• Some extremal problems on the distance involving peripheral vertices of trees with given matching number

This page was built for publication: Extremal bounds on peripherality measures

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