On The Commuting Graph of Semidihedral Group
Jitender Kumar, Sandeep Dalal, and Vedant Baghel

TL;DR
This paper explores the properties of the commuting graph of the semidihedral group, analyzing various graph invariants, spectrum, and metric properties to deepen understanding of its structure.
Contribution
It provides a detailed analysis of the commuting graph of semidihedral groups, including new results on invariants, spectrum, and metric properties.
Findings
Determined minimum degree, vertex connectivity, independence number, and matching number.
Computed Laplacian spectrum and metric dimension.
Analyzed detour properties of the commuting graph.
Abstract
The commuting graph of a finite non-abelian group is a simple graph with vertex set and two distinct vertices are adjacent if . In this paper, among some properties of , we investigate the commuting graph of the semidihedral group . In this connection, we discuss various graph invariants of including minimum degree, vertex connectivity, independence number, matching number and detour properties. We also obtain the Laplacian spectrum, metric dimension and resolving polynomial of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
