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 |
id |
oai:animorepository.dlsu.edu.ph:faculty_research-3861 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-38612021-11-17T10:18:24Z Resistance distance in complete n-partite graphs Gervacio, Severino V. 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. 2016-04-20T07:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/2862 Faculty Research Work Animo Repository Electric resistance Graph theory Complete graphs Mathematics |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
topic |
Electric resistance Graph theory Complete graphs Mathematics |
spellingShingle |
Electric resistance Graph theory Complete graphs Mathematics Gervacio, Severino V. Resistance distance in complete n-partite graphs |
description |
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. |
format |
text |
author |
Gervacio, Severino V. |
author_facet |
Gervacio, Severino V. |
author_sort |
Gervacio, Severino V. |
title |
Resistance distance in complete n-partite graphs |
title_short |
Resistance distance in complete n-partite graphs |
title_full |
Resistance distance in complete n-partite graphs |
title_fullStr |
Resistance distance in complete n-partite graphs |
title_full_unstemmed |
Resistance distance in complete n-partite graphs |
title_sort |
resistance distance in complete n-partite graphs |
publisher |
Animo Repository |
publishDate |
2016 |
url |
https://animorepository.dlsu.edu.ph/faculty_research/2862 |
_version_ |
1718383280167845888 |