On the monotonicity of topological indices and the connectivity of a graph

Renfang Wu, Hanlin Chen and Hanyuan Deng

Applied Mathematics and Computation, 2017, vol. 298, issue C, 188-200

Abstract: Let I(G) be a topological index of a graph. If I(G+e)I(G), respectively) for each edge e∉G, then I(G) decreases (or increases, respectively) with addition of edges. In this paper, we determine the extremal values of some monotonic topological indices in terms of the number of cut vertices, or the number of cut edges, or the vertex connectivity, or the edge connectivity of a graph, and characterize the corresponding extremal graphs among all graphs of order n.

Keywords: Topological index; Monotonicity; Connectivity (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316306853
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:298:y:2017:i:c:p:188-200

DOI: 10.1016/j.amc.2016.11.017

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().