2007
DOI: 10.1016/j.dam.2006.09.008
|View full text |Cite
|
Sign up to set email alerts
|

Resistance distance and the normalized Laplacian spectrum

Abstract: It is well known that the resistance distance between two arbitrary vertices in an electrical network can be obtained in terms of the eigenvalues and eigenvectors of the combinatorial Laplacian matrix associated with the network. By studying this matrix, people have proved many properties of resistance distances. But in recent years, the other kind of matrix, named the normalized Laplacian, which is consistent with the matrix in spectral geometry and random walks [Chung, F.R.K., Spectral Graph Theory, American… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
217
0

Year Published

2007
2007
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 295 publications
(218 citation statements)
references
References 16 publications
1
217
0
Order By: Relevance
“…It was observed in [CZ07] that the latter expression 2m λ =1 1 1−λ equals K π 2 (G), but apparently the resulting fact that CC π (x) = K π 2 (G) has not been noticed before. It is thus worth pointing out this triple equality:…”
Section: Rc(v) + (2n − 1)cc(v) = 4(n − 1)w (T )mentioning
confidence: 99%
“…It was observed in [CZ07] that the latter expression 2m λ =1 1 1−λ equals K π 2 (G), but apparently the resulting fact that CC π (x) = K π 2 (G) has not been noticed before. It is thus worth pointing out this triple equality:…”
Section: Rc(v) + (2n − 1)cc(v) = 4(n − 1)w (T )mentioning
confidence: 99%
“…, n − 1 and (1), we obtain that A = 2m n−2 . By substituting A = 2m n−2 in (6) we arrive at (5). Having in mind that equality in (3), for n := n − 1, occurs if and only if a 1 = a 2 = · · · = a n−1 , equality in (5) …”
Section: Equality Holds If and Only If Gmentioning
confidence: 99%
“…Then, the average path lengthl is given byl = 2W(G)/n(n− 1). The analogue of the Wiener index in the context of the resistance distance matrix is known as the Kirchhoff index Kf and is defined as Kf = i<j Ω ij [6,25,35,36,38]. It is known that Kf can be expressed in terms of the Laplacian eigenvalues as follows [35]:…”
Section: Resistance Distance In Networkmentioning
confidence: 99%