| تعداد نشریات | 11 |
| تعداد شمارهها | 227 |
| تعداد مقالات | 2,290 |
| تعداد مشاهده مقاله | 3,541,615 |
| تعداد دریافت فایل اصل مقاله | 2,591,583 |
Power graphs via their characteristic polynomial | ||
| Journal of Discrete Mathematics and Its Applications | ||
| مقاله 5، دوره 8، شماره 3، آذر 2023، صفحه 157-169 اصل مقاله (1.24 M) | ||
| نوع مقاله: Full Length Article | ||
| شناسه دیجیتال (DOI): 10.22061/jdma.2023.2030 | ||
| نویسنده | ||
| Fatemeh Abbasi-Barfaraz* | ||
| Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-163, I. R. Iran | ||
| تاریخ دریافت: 11 تیر 1402، تاریخ بازنگری: 31 تیر 1402، تاریخ پذیرش: 07 شهریور 1402 | ||
| چکیده | ||
| A power graph is defined a graph that it's vertices are the elements of group and two vertices are adjacent if and only if one of them is a power of the other. Suppose $A(X)$ is the adjacency matrix of graph $X$. Then the polynomial $\chi(X,\lambda)=det(xI-A(X))$ is called as characteristic polynomial of $X$. In this paper, we compute the characteristic polynomial of all power graphs of order $p^2q$, where $p,q$ are distinct prime numbers. | ||
| کلیدواژهها | ||
| power graph؛ characteristic polynomial؛ generelized coalescence | ||
|
آمار تعداد مشاهده مقاله: 174 تعداد دریافت فایل اصل مقاله: 370 |
||