Co-maximal Hypergraph on Dn

Abstract

Let G be a group and S be the set of all non-trivial proper subgroups of G. The co-maximal hypergraph of G, denoted by CoH(G), is a hypergraph whose vertex set is \H ∈ S \,\, | \,\, H K = G \,\, for some \, K ∈ S \ and hyperedges are the maximal subsets of the vertex set with the property that the product of any two vertices is equal to G. The aim of this paper is to study the co-maximal hypergraph of dihedral groups, CoH(Dn). We examine some of the structural properties, viz., diameter, girth and chromatic number of CoH(Dn). Also, we provide characterizations for hypertrees, star structures and 3-uniform hypergraphs of CoH(Dn). Further, we discuss the possibilities of CoH(Dn) which can be embedded on the plane, torus and projective plane.

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…