Affiliation:
1. Department of Mathematics, Ningbo University, Ningbo 315211, P. R. China
Abstract
The eigentime identity for random walks on networks is the expected time for a walker going from a node to another node. In this paper, our purpose is to calculate the eigentime identities of flower networks by using the characteristic polynomials of normalized Laplacian and recurrent structure of Markov spectrum.
Funder
National Natural Science Foundation of China
K.C. Wong Magna Fund in Ningbo University
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Geometry and Topology,Modeling and Simulation
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献