Forbidden Subgraphs of co-prime Graphs of finite Groups

Abstract

For a finite group G the co-prime graph (G) is defined as a graph with vertex set G in which two distinct vertices x and y are adjacent if and only if gcd(o(x),o(y))=1 where o(x) and o(y) denote the orders of the elements x and y respectively. In this paper we find properties of groups whose co-prime graphs forbid graphs such as C4,K1,3,P4 and asteroidal triples.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…