Group Perfect Code in Commuting Order Product Prime Graph

Bello, Muhammed; Ali, Nor Muhainiah Mohd; Isah, Surajo Ibrahim

doi:10.17654/dm025010041

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 4 [25] Disjoint union and join of graphs Let Γ 1 = (V 1 , E 1 ) and Γ 2 = (V 2 , E 2 ) be two subgraphs of Γ. The disjoint union of the graphs, Γ 1 ∪ Γ 2 is a graph with the vertex set V 1 ∪ V 2 and edge set E 1 ∪ E 2 , where V 1 and V 2 are disjoint sets of vertices.…”

Section: By Lettingmentioning

confidence: 99%

Laplacian Spectrum and Energy of the Cyclic Order Product Prime Graph of Semi-dihedral Groups

Mohamed,

Mohd Ali,

Bello

2024

Mal. J. Fund. Appl. Sci.

View full text Add to dashboard Cite

This paper introduces cyclic order product prime graphs to examine the spectral graph properties of semi-dihedral groups, specifically focusing on the Laplacian spectrum and energy. Combining principles from cyclic graphs and order product prime graphs enhances understanding of group algebraic structures. In this context, the cyclic order product prime graph for a finite group is defined as one where two distinct vertices are adjacent if their generated subgroup is cyclic, and the product of their orders is a prime power. Our methodological approach begins with establishing a general presentation for these graphs within semi-dihedral groups. This foundational step is essential for deriving some properties, such as vertex degrees, the number of edges, and Laplacian characteristic polynomials. This information subsequently facilitates the determination of the Laplacian spectrum, characterized by seven eigenvalues of various multiplicities, and the computation of their Laplacian energy. The semi-dihedral group of order 16 is a particular example to illustrate the practicality and generality of our theorems.

show abstract

Section: By Lettingmentioning

confidence: 99%