The Generating graph of Dicyclic Groups

Abstract

For a group G, the generating graph of G, denoted by (G). We define Qn= x,y: x2n=y4=1, xn=y2,y-1xy=x-1, the dicyclic group of order 4n. This paper primarily delves into exploring the graph characteristics and spectral properties of various matrices associated with (Qn). Specifically, we determine the complete spectrum of the adjacency, Laplacian, distance, and eccentricity matrices. Additionally, we completely determine the spectrum pertaining to the distance and eccentricity matrices of the dihedral group of order 2n, denoted as Dn.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…