On the Non-Commuting Graph of Dihedral Group
Abstract
For a nonabelian group G, the non-commuting graph G of G is defined as the graph with vertex set G-Z(G), where Z(G) is the center of G, and two distinct vertices of G are adjacent if they do not commute in G. In this paper, we investigate the detour index, eccentric connectivity and total eccentricity polynomials of non-commuting graph on D2n. We also find the mean distance of non-commuting graph on D2n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.