APPLICATIONS OF LAPLACIAN SPECTRA ON A 3-PRISM GRAPH
Authors:
- 8 January 2014
- journal article
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters B
- Vol. 28 (02)
Abstract
In this paper, we calculate the Laplacian spectra of a 3-prism graph and apply them. This graph is both planar and polyhedral, and belongs to the generalized Petersen graph. Using the regular structures of this graph, we obtain the recurrent relationships for Laplacian matrix between this graph and its initial state — a triangle — and further derive the corresponding relationships for Laplacian eigenvalues between them. By these relationships, we obtain the analytical expressions for the product and the sum of the reciprocals of all nonzero Laplacian eigenvalues. Finally we apply these expressions to calculate the number of spanning trees and mean first-passage time (MFPT) and see that the scaling of MFPT with the network size N is N2, which is larger than those performed on some uniformly recursive trees.Keywords
This publication has 25 references indexed in Scilit:
- Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applicationsThe Journal of Chemical Physics, 2013
- Explicit determination of mean first-passage time for random walks on deterministic uniform recursive treesPhysical Review E, 2010
- Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networksPhysical Review E, 2009
- Critical phenomena in complex networksReviews of Modern Physics, 2008
- Evolutionary games on graphsPhysics Reports, 2007
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Evolution of networksAdvances in Physics, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Molecular cyclicity and centricity of polycyclic graphs. I. Cyclicity based on resistance distances or reciprocal distancesInternational Journal of Quantum Chemistry, 1994