Skip to main navigation Skip to search Skip to main content

Properties of commuting graphs over semidihedral groups

  • Tao Cheng
  • , Matthias Dehmer*
  • , Frank Emmert-Streib
  • , Yongtao Li
  • , Weijun Liu
  • *Corresponding author for this work
  • Shandong Normal University
  • Swiss Distance University of Applied Sciences
  • Nankai University
  • Xi'an Technological University
  • Private University for Health Sciences, Medical Informatics and Technology
  • Tampere University
  • Institute of Biosciences and Medical Technology
  • Hunan University
  • Central South University

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Article number103
Pages (from-to)1-15
Number of pages15
JournalSymmetry
Volume13
Issue number1
DOIs
Publication statusPublished - Jan 2021
Externally publishedYes

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