Co-maximal Hypergraph on Dn
Combinatorics
2025-05-01 v1
Abstract
Let be a group and be the set of all non-trivial proper subgroups of . \textit{The co-maximal hypergraph of }, denoted by , is a hypergraph whose vertex set is and hyperedges are the maximal subsets of the vertex set with the property that the product of any two vertices is equal to . The aim of this paper is to study the co-maximal hypergraph of dihedral groups, . We examine some of the structural properties, viz., diameter, girth and chromatic number of . Also, we provide characterizations for hypertrees, star structures and 3-uniform hypergraphs of . Further, we discuss the possibilities of which can be embedded on the plane, torus and projective plane.
Cite
@article{arxiv.2504.21554,
title = {Co-maximal Hypergraph on Dn},
author = {Sachin Ballal and Ardra A N},
journal= {arXiv preprint arXiv:2504.21554},
year = {2025}
}