Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Palacios, José Luis
Renom, José Miguel
and
Berrizbeitia, Pedro
1999.
Random walks on edge-transitive graphs (II).
Statistics & Probability Letters,
Vol. 43,
Issue. 1,
p.
25.
Bendito, Enrique
Carmona, Angeles
and
Encinas, Andrés M.
2000.
Shortest Paths in Distance-regular Graphs.
European Journal of Combinatorics,
Vol. 21,
Issue. 2,
p.
153.
Palacios, Jos� Luis
2001.
Closed-form formulas for Kirchhoff index.
International Journal of Quantum Chemistry,
Vol. 81,
Issue. 2,
p.
135.
Bendito, Enrique
Carmona, Ángeles
and
Encinas, Andrés M.
2003.
Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures.
European Journal of Combinatorics,
Vol. 24,
Issue. 4,
p.
365.
Haiyan, Chen
and
Fuji, Zhang
2004.
The expected hitting times for graphs with cutpoints.
Statistics & Probability Letters,
Vol. 66,
Issue. 1,
p.
9.
Chung, Soon-Yeong
and
Berenstein, Carlos A.
2005.
$\omega$-Harmonic Functions and Inverse Conductivity Problems on Networks.
SIAM Journal on Applied Mathematics,
Vol. 65,
Issue. 4,
p.
1200.
Chen, Haiyan
and
Zhang, Fuji
2008.
The expected hitting times for finite Markov chains.
Linear Algebra and its Applications,
Vol. 428,
Issue. 11-12,
p.
2730.
Bendito, Enrique
Carmona, Angeles
Encinas, Andres M.
and
Gesto, Jose M.
2008.
A formula for the Kirchhoff index.
International Journal of Quantum Chemistry,
Vol. 108,
Issue. 6,
p.
1200.
Jafarizadeh, M. A.
Sufiani, R.
and
Jafarizadeh, S.
2008.
Calculating effective resistances on underlying networks of association schemes.
Journal of Mathematical Physics,
Vol. 49,
Issue. 7,
Chung, Soon-Yeong
2010.
IDENTIFICATION OF RESISTORS IN ELECTRICAL NETWORKS.
Journal of the Korean Mathematical Society,
Vol. 47,
Issue. 6,
p.
1223.
Yujun Yang
2011.
Expected hitting times for simple random walks on wheel graphs.
p.
5841.
Park, Jea-Hyun
and
Chung, Soon-Yeong
2011.
The Dirichlet boundary value problems forp-Schrödinger operators on finite networks.
Journal of Difference Equations and Applications,
Vol. 17,
Issue. 05,
p.
795.
Koolen, Jack H.
Markowsky, Greg
and
Park, Jongyook
2013.
On electric resistances for distance-regular graphs.
European Journal of Combinatorics,
Vol. 34,
Issue. 4,
p.
770.
Yang, Yujun
and
Klein, Douglas J.
2013.
A recursion formula for resistance distances and its applications.
Discrete Applied Mathematics,
Vol. 161,
Issue. 16-17,
p.
2702.
Koolen, Jack H.
and
Markowsky, Greg
2016.
A collection of results concerning electric resistance and simple random walk on distance-regular graphs.
Discrete Mathematics,
Vol. 339,
Issue. 2,
p.
737.
Zhou, Jiang
Sun, Lizhu
and
Bu, Changjiang
2017.
Resistance characterizations of equiarboreal graphs.
Discrete Mathematics,
Vol. 340,
Issue. 12,
p.
2864.
Li, Shuchao
and
Wang, Shujing
2020.
Extremal cover cost and reverse cover cost of trees with given segment sequence.
Discrete Mathematics,
Vol. 343,
Issue. 4,
p.
111791.
Zhou, Jiang
Bu, Changjiang
and
Lai, Hong-Jian
2021.
Edge-disjoint spanning trees and forests of graphs.
Discrete Applied Mathematics,
Vol. 299,
Issue. ,
p.
74.
Sardar, Muhammad Shoaib
Liu, Jia-Bao
Siddique, Imran
and
Jaradat, Mohammed M. M.
2021.
A Novel and Efficient Method for Computing the Resistance Distance.
IEEE Access,
Vol. 9,
Issue. ,
p.
107104.
Azimi, A.
Bapat, R.B.
and
Farrokhi D.G., M.
2021.
Resistance distance of blowups of trees.
Discrete Mathematics,
Vol. 344,
Issue. 7,
p.
112387.