Maximizing Kirchhoff index of unicyclic graphs with fixed maximum degree
classification
🧮 math.CO
keywords
graphindexkirchhoffmaximumdegreefixedgraphsunicyclic
read the original abstract
The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a variety of fields. In this paper, we determine the maximum value of Kirchhoff index among the unicyclic graphs with fixed number of vertices and maximum degree, and characterize the corresponding extremal graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.