Authors: A Babai B Khosravi
Publish Date: 2014/11/20
Volume: 66, Issue: 5, Pages: 666-677
Abstract
Let G be a finite group The prime graph of G is denoted by ΓG Let G be a finite group such that ΓG = ΓD n 5 where n ≥ 6 In the paper as the main result we show that if n is odd then G is recognizable by the prime graph and if n is even then G is quasirecognizable by the prime graph
Keywords: