kirchhoff index and degree kirchhoff index of complete multipartite graph
Combinatorics
2016-11-30 v1
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
Keywords
Cite
@article{arxiv.1611.09457,
title = {kirchhoff index and degree kirchhoff index of complete multipartite graph},
author = {Ravindra B. Bapat and Masoud Karimi and Jia-Bao Liu},
journal= {arXiv preprint arXiv:1611.09457},
year = {2016}
}