Abstract
This paper considers commuting graphs over the semidihedral group SD8n . We compute their eigenvalues and obtain that these commuting graphs are not hyperenergetic for odd n ≥ 15 or even n ≥ 2. We further compute the Laplacian spectrum, the Laplacian energy and the number of spanning trees of the commuting graphs over SD8n . We also discuss vertex connectivity, planarity, and minimum disconnecting sets of these graphs and prove that these commuting graphs are not Hamiltonian.
| Original language | English |
|---|---|
| Article number | 103 |
| Pages (from-to) | 1-15 |
| Number of pages | 15 |
| Journal | Symmetry |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2021 |
| Externally published | Yes |
Keywords
- Commuting graph
- Graph spectrum
- Semidihedral groups
- Spectral radius
Fingerprint
Dive into the research topics of 'Properties of commuting graphs over semidihedral groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver