Electrical networks and algebraic graph theory: Models, properties, and applications
F Dörfler, JW Simpson-Porco… - Proceedings of the IEEE, 2018 - ieeexplore.ieee.org
Algebraic graph theory is a cornerstone in the study of electrical networks ranging from
miniature integrated circuits to continental-scale power systems. Conversely, many …
miniature integrated circuits to continental-scale power systems. Conversely, many …
Matrix analysis of hexagonal model and its applications in global mean-first-passage time of random walks
Recent advances in graph-structured learning have demonstrated promising results on the
graph classification task. However, making them scalable on huge graphs with millions of …
graph classification task. However, making them scalable on huge graphs with millions of …
Spectral techniques and mathematical aspects of K 4 chain graph
The resistance distance between any two vertices of a connected graph is defined as the net
effective resistance between them. An electrical network can be constructed from a graph by …
effective resistance between them. An electrical network can be constructed from a graph by …
Algorithmic techniques for finding resistance distances on structured graphs
EJ Evans, AE Francis - Discrete Applied Mathematics, 2022 - Elsevier
In this paper, we give a survey of methods used to calculate values of resistance distance
(also known as effective resistance) in graphs. Resistance distance has played a prominent …
(also known as effective resistance) in graphs. Resistance distance has played a prominent …
Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
S Zaman - International Journal of Computer Mathematics, 2022 - Taylor & Francis
A network is defined as an abstract structure that consists of nodes that are connected by
links. In this paper, we study two types of rounded networks N n (resp., N n′). By using the …
links. In this paper, we study two types of rounded networks N n (resp., N n′). By using the …
The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
J Huang, S Li, X Li - Applied mathematics and computation, 2016 - Elsevier
Let B n be a linear polyomino chain with n squares. In this paper, according to the
decomposition theorem of normalized Laplacian polynomial, we obtain that the normalized …
decomposition theorem of normalized Laplacian polynomial, we obtain that the normalized …
Kirchhoff index, multiplicative degree‐Kirchhoff index and spanning trees of the linear crossed hexagonal chains
Y Pan, J Li - International journal of quantum chemistry, 2018 - Wiley Online Library
Let Hn be a linear crossed hexagonal chain with n crossed hexagonals. In this article, we
find that the Laplacian (resp. normalized Laplacian) spectrum of Hn consists of the …
find that the Laplacian (resp. normalized Laplacian) spectrum of Hn consists of the …
[HTML][HTML] The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
Z Zhu, JB Liu - Discrete applied mathematics, 2019 - Elsevier
Abstract Recently, Peng and Li (2017) derived an explicit closed formula of Kirchhoff index
and the number of spanning trees of linear phenylenes and their dicyclobutadieno …
and the number of spanning trees of linear phenylenes and their dicyclobutadieno …
[PDF][PDF] On the Kirchhoff index and the number of spanning trees of linear phenylenes
YJ Peng, SC Li - MATCH Commun. Math. Comput. Chem, 2017 - match.pmf.kg.ac.rs
Let Ln be the molecular graph of linear [n] phenylene, and Ln the graph obtained by
attaching 4-membered cycles to the terminal hexagons of Ln− 1. Thus, Ln is the molecular …
attaching 4-membered cycles to the terminal hexagons of Ln− 1. Thus, Ln is the molecular …
[HTML][HTML] The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
J Huang, S Li, L Sun - Discrete Applied Mathematics, 2016 - Elsevier
Let L n be a linear hexagonal chain with n hexagons. In this paper, according to the
decomposition theorem of normalized Laplacian polynomial of a graph, we obtain that the …
decomposition theorem of normalized Laplacian polynomial of a graph, we obtain that the …