The Laplacian Spectrum of the Generalized $n$-Prism Networks

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Eliasi Mehdi

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Chemistry Year:2024 | Volume:15 | Issue:2 Page(s): 65-78

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

The Laplacian Spectrum of the Generalized $n$-Prism Networks

Author(s)

Eliasi Mehdi | Issue Writer Certificate

Keywords

Laplacian spectra

Prism network

Spanning tree‎

Kirchhoff index

Abstract

‎The Laplacian eigenvalues and polynomials of the networks play an essential role in understanding the relations between the topology and the dynamic of networks‎. ‎Generally‎, ‎computation of the Laplacian spectrum of a network is a hard problem and there are just a few classes of graphs with the property that their spectra have been completely computed‎. ‎Laplacian spectrum for $ n$-prism networks was investigated in [Liu et al.‎, ‎Neurocomputing 198 (2016) 69-73]‎. ‎In this paper‎, ‎we give a method for calculating the eigenvalues and characteristic polynomial of the Laplacian matrix of a generalized $n$-prism network‎. ‎We show how such large networks can be constructed from small graphs by using graph products‎. ‎Moreover‎, ‎our results are used to obtain the Kirchhoff index and the number of the spanning trees in the generalized $n$-prism networks‎. ‎We also give some examples of applications‎, ‎that explain the usefulness and efficiency of the proposed method‎.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans