The minimal Kirchhoff index of graphs with a given number of cut vertices-Reference-Cited by-同舟云学术

The minimal Kirchhoff index of graphs with a given number of cut vertices

Published:2016 Issue:13 Volume:30 Page:3451-3463
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Xu Kexiang¹,Liu Hongshuang¹,Yang Yujun²,Das Kinkar³

Affiliation:

1. Nanjing University of Aeronautics and Astronautics, College of Science, Nanjing, Jiangsu, PR China

2. Yantai University, School of Mathematics and Information Science, Yantai, Shandong, PR China

3. Sungkyunkwan University, Department of Mathematics, Suwon, Republic of Korea

Abstract

The resistance distance was introduced by Klein and Randic as a generalization of the classical distance. The Kirchhoff index Kf (G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this paper we determine the extremal graphs with minimal Kirchhoff index among all n-vertex graphs with k cut vertices where 1 ? k < n/2.

Publisher

National Library of Serbia

Subject

General Mathematics

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proofs to Some Open Problems on the Maximum Sombor Index of Graphs;Computational and Applied Mathematics;2023-08-11

2. On Sombor Index of Graphs with a Given Number of Cut-Vertices;MATCH Communications in Mathematical and in Computer Chemistry;2022-08

4. Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs;Discrete Dynamics in Nature and Society;2020-08-08

5. Resistance Distance and Kirchhoff Index of Generalized Subdivision-Vertex and Subdivision-Edge Corona for Graphs;IEEE Access;2019