Forbidden Subgraphs of Prime Order Element Graph
Abstract
In this paper, we study different forbidden subgraph characterizations of the prime-order element graph (G) defined on a finite group G. Its set of vertices is the group G and two vertices x,y ∈ G are adjacent if the order of xy is prime. More specifically, we investigate the conditions when (G) is perfect, cograph, chordal, claw-free, and interval graph.
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.