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:
主要作者: | Lubguban, Alona A. |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
2014
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_doctoral/394 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Resistance distance in complete n-partite graphs
由: Gervacio, Severino V.
出版: (2016) -
On applications of the retracing method for distance-regular graphs
由: Vencer, Norma Luz C.
出版: (2006) -
Notions of domination for some classses of graphs
由: Castaneda, Adrian Timothy S., et al.
出版: (2015) -
A characterization of Q-polynomial distance-regular graphs
由: Pascasio, Arlene A.
出版: (2008) -
Tight distance-regular graphs and the subconstituent algebra
由: Go, Junie T., et al.
出版: (2002)