Resistance distance in some composition of graphs
In graph theory, the resistance distance between any two vertices of a simple connected graph G is equal to the e ective resistance between two corresponding nodes on an electrical network, constructed so as to correspond to G, with each edge being replaced by a unit resistor or a 1 ohm resistance....
Saved in:
Main Author: | Lubguban, Alona A. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2014
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_doctoral/394 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Resistance distance in complete n-partite graphs
by: Gervacio, Severino V.
Published: (2016) -
On applications of the retracing method for distance-regular graphs
by: Vencer, Norma Luz C.
Published: (2006) -
Notions of domination for some classses of graphs
by: Castaneda, Adrian Timothy S., et al.
Published: (2015) -
A characterization of Q-polynomial distance-regular graphs
by: Pascasio, Arlene A.
Published: (2008) -
Tight distance-regular graphs and the subconstituent algebra
by: Go, Junie T., et al.
Published: (2002)