Algebraic graph theory is a cornerstone in the study of electrical networks ranging from
miniature integrated circuits to continental-scale power systems. Conversely, many …

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 …

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 …

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 …

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 …

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 …

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 …

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 …

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 …

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 …