The non-commuting graph, denoted by , is defined on a finite group , with its vertices are elements of excluding those in the center of . In this graph, two distinct vertices are adjacent whenever they do not commute in . The graph can be associated with several matrices including the most basic matrix, which is the adjacency matrix, , and a matrix called Sombor matrix, denoted by . The entries of are either the square root of the sum of the squares of degrees of two distinct adjacent vertices, or zero otherwise. Consequently, the adjacency and Sombor energies of is the sum of the absolute eigenvalues of the adjacency and Sombor matrices of , respectively, whereas the spectral radius of is the maximum absolute eigenvalues. Throughout this paper, we find the spectral radius obtained from the spectrum of and the Sombor energy of for dihedral groups of order , where . Moreover, there is an almost linear correlation between the Sombor energy and the adjacency energy of for which is slightly different than reported earlier in previous literature.
The neighbors degree sum (NDS) energy of a graph is determined by the sum of its absolute eigenvalues from its corresponding neighbors degree sum matrix. The non-diagonal entries of NDS−matrix are the summation of the degree of two adjacent vertices, or it is zero for non-adjacent vertices, whereas for the diagonal entries are the negative of the square of vertex degree. This study presents the formulas of neighbors degree sum energies of commuting and non-commuting graphs for dihedral groups of order 2n, D2n, for two cases−odd and even n. The results in this paper comply with the well known fact that energy of a graph is neither an odd integer nor a square root of an odd integer.
2 January 2015 in The Electronic Journal of Combinatorics
The commuting graph $\mathcal{C}(G,X)$, where $G$ is a group and $X$ is a subset of $G$, is the graph with vertex set $X$ and distinct vertices being joined by an edge whenever they commute. Here the diameter of $\mathcal{C}(G,X)$ is studied when $G$ is a symmetric group and $X$ a conjugacy class of elements of order $3$.
A commuting graph is a graph denoted by where G is any group and X, a subset of a group G, is a set of vertices for . Two distinct vertices, , will be connected by an edge if the commutativity property is satisfied or . This study presents results for the connectivity of when G is a symmetric group of degree n, Sym , and X is a conjugacy class of elements of order three in G.