On The Commuting Graph of Semidihedral Group

Abstract

The commuting graph (G) of a finite non-abelian group G is a simple graph with vertex set G and two distinct vertices x, y are adjacent if xy = yx. In this paper, among some properties of (G), we investigate (SD8n) the commuting graph of the semidihedral group SD8n. In this connection, we discuss various graph invariants of (SD8n) including minimum degree, vertex connectivity, independence number, matching number and detour properties. We also obtain the Laplacian spectrum, metric dimension and resolving polynomial of (SD8n).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…