Resistance distance in complete n-partite graphs
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 thi...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2016
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/2862 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | 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. |
|---|