Intersection Hypergraph on Dn
Abstract
Let G be a group and S be the set of all non-trivial proper subgroups of G. The intersection hypergraph of G, denoted by H(G), is a hypergraph whose vertex set is \H ∈ S \,\, | \,\, H K = \e\ \,\, for some \, K ∈ S \ and hyperedges are the maximal subsets of the vertex set with the property that any two vertices in it have a trivial intersection. The aim of this paper is to study the intersection hypergraph of dihedral groups, H(Dn). We examine some of the structural properties, viz., diameter, girth and chromatic number of H(Dn). Also, we provide characterizations for hypertreees, star structures of H(Dn), and investigate the planarity and non-planarity of H(Dn).
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.