kirchhoff index and degree kirchhoff index of complete multipartite graph

2016/11/29 by R.B. Bapat, Masoud Karimi, Bapat, Ravindra B. +3
Chemistry · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #Zeolite Catalysis and Synthesis

paper · pdf · doi:10.48550/arxiv.1611.09457

openalex publication_date 2016/11/29 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28

Abstract

The Kirchhoff index of a graph is defined as half of the sum of all effective resistance distances between any two vertices. Assuming a complete multipartite graph G, by methods from linear algebra we explicitly formulate effective resistance distances between any two vertices of G, and its Kirchhoff index. In rest of paper we explore extremal value of Kirchhoff index for multipartite graphs

Related

• Maximizing Kirchhoff index of unicyclic graphs with fixed maximum degree
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• The resistance distance and Kirchhoff index on quadrilateral graph and pentagonal graph
• Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
• Extremal octagonal chains with respect to the Kirchhoff index