|国家预印本平台
首页|Co-maximal Hypergraph on Dn

Co-maximal Hypergraph on Dn

Co-maximal Hypergraph on Dn

来源:Arxiv_logoArxiv
英文摘要

Let $G$ be a group and $S$ be the set of all non-trivial proper subgroups of $G$. \textit{The co-maximal hypergraph of $G$}, denoted by $Co_\mathcal{H}(G)$, is a hypergraph whose vertex set is $\{H \in S \,\, | \,\, H K = G \,\, \text{for some} \, K \in 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, $Co_\mathcal{H}(D_n)$. We examine some of the structural properties, viz., diameter, girth and chromatic number of $Co_\mathcal{H}(D_n)$. Also, we provide characterizations for hypertrees, star structures and 3-uniform hypergraphs of $Co_\mathcal{H}(D_n)$. Further, we discuss the possibilities of $Co_\mathcal{H}(D_n)$ which can be embedded on the plane, torus and projective plane.

Sachin Ballal、Ardra A N

数学

Sachin Ballal,Ardra A N.Co-maximal Hypergraph on Dn[EB/OL].(2025-04-30)[2025-05-21].https://arxiv.org/abs/2504.21554.点此复制

评论