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

详细信息    查看全文

• 作者：Renfang Wu ; Hanlin Chen ; Hanyuan Deng ; ^{hydeng@hunnu.edu.cn}
• 关键词：Topological index ; Monotonicity ; Connectivity
• 刊名：Applied Mathematics and Computation
• 出版年：2017
• 出版时间：1 April 2017
• 年：2017
• 卷：298
• 期：Complete
• 页码：188-200
• 全文大小：554 K
• 卷排序：298

文摘

Let I(G  ) be a topological index of a graph. If I(G+e)<I(G)I(G+e)<I(G) (or I(G+e)>I(G),I(G+e)>I(G), respectively) for each edge e∉G,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.