Computing the spectrum of L^t(G) for a regular graph
Publish place: Global Analysis And Discrete Mathematics، Vol: 7، Issue: 2
Publish Year: 1401
نوع سند: مقاله ژورنالی
زبان: English
View: 135
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_GADM-7-2_008
تاریخ نمایه سازی: 28 شهریور 1402
Abstract:
If L(G) is the line graph of G, it is difficult to get the adjacency matrix of Lt(G)=L(L(L ... L(G))); t≥۳ and also its spectrum. In this paper, we present a formula to compute the spectrum of Lt(G), for each positive integer t, where G is a regular graph.
Keywords:
Line graph , Simple graph , Adjacency matrix , Eigenvalue of a matrix , Characteristic polynomial , Spectra of a graph
Authors
Saeed Mohammadian Semnani
Department of Mathematics, Faculty of Mathematics, Statistics and Computer Sciences, Semnan University, Semnan, Iran.