Resistance distance in complete n-partite graphs
College
College of Science
Department/Unit
Mathematics and Statistics Department
Document Type
Article
Source Title
Discrete Applied Mathematics
Volume
203
First Page
53
Last Page
61
Publication Date
4-20-2016
Abstract
We may view any graph as a network of resistors each having a resistance of 1 Ω. The resistance distance between a pair of vertices in a graph is defined as the effective resistance between the two vertices. This function is known to be a metric on the vertex-set of any graph. The main result of this paper is an explicit expression for the resistance distance between any pair of vertices in the complete n-partite graph Km1,m2,⋯,mn. © 2016 Elsevier B.V. All rights reserved.
html
Digitial Object Identifier (DOI)
10.1016/j.dam.2015.09.017
Recommended Citation
Gervacio, S. V. (2016). Resistance distance in complete n-partite graphs. Discrete Applied Mathematics, 203, 53-61. https://doi.org/10.1016/j.dam.2015.09.017
Disciplines
Mathematics
Keywords
Electric resistance; Graph theory; Complete graphs
Upload File
wf_no