Characteristic polynomial of power graph for dihedral groups using degree-based matrices
A fundamental feature of spectral graph theory is the correspondence between matrix and graph. As a result of this relation, the characteristic polynomial of the graph can be formulated. This research focuses on the power graph of dihedral groups using degree-based matrices. Throughout this paper, w...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/113379/1/113379.pdf http://psasir.upm.edu.my/id/eprint/113379/ https://mjfas.utm.my/index.php/mjfas/article/view/3357 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A fundamental feature of spectral graph theory is the correspondence between matrix and graph. As a result of this relation, the characteristic polynomial of the graph can be formulated. This research focuses on the power graph of dihedral groups using degree-based matrices. Throughout this paper, we formulate the characteristic polynomial of the power graph of dihedral groups based on seven types of graph matrices which include the maximum degree, the minimum degree, the greatest common divisor degree, the first Zagreb, the second Zagreb, the misbalance degree, and the Nirmala matrices. |
|---|