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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
