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: | Gervacio, Severino V. |
---|---|
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 |
Similar Items
-
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graph
by: David, Monica Carlita G., et al.
Published: (2018) -
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graphs
by: David, Monica Carlita G., et al.
Published: (2018) -
Subdivision number of large complete graphs and large complete multipartite graphs
by: Gervacio, Severino V.
Published: (2005) -
Characterizing 2-distance graphs
by: Ching, Ramuel P, et al.
Published: (2019) -
On complete 4-partite graphs with spanning maximal planar subgraphs
by: Estrada, Tjaart Jan B.
Published: (2018)