On The Commuting Graph of Semidihedral Group
Group Theory
2020-08-18 v1 Combinatorics
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 .
Keywords
Cite
@article{arxiv.2008.07098,
title = {On The Commuting Graph of Semidihedral Group},
author = {Jitender Kumar and Sandeep Dalal and Vedant Baghel},
journal= {arXiv preprint arXiv:2008.07098},
year = {2020}
}