| Summary: | The mean first-passage time of random walks on a network has been extensively applied in the theory and practice of statistical physics, and its application effects depend on the behavior of first-passage time. Here, we firstly define a graphic operation, namely, rectangle operation, for generating a scale-free network. In this paper, we study the topological structures of our network obtained from the rectangle operation, including degree distribution, clustering coefficient, and diameter. And then, we also consider the characteristic quantities related to the network, including Kirchhoff index and mean first-passage time, where these characteristic quantities can not only be used to evaluate the properties of our network, but also have remarkable applications in science and engineering.
|
|---|
