Critical classes of power graphs and reconstruction of directed power graphs

HIGHLIGHTS

• What: As the Main Theorem, the authors show that, given a power graph € D P.G/, for a certain finite group G, E.G/ by purely arithmetical and graph theoretical con the authors can always reconstruct P siderations, without taking into account any group theoretical information about G (see Section 6.1 for formal details). The authors show that Q is a graph automorphism of €. The authors show that, for every x; y 2 V with x ¤ y, the authors have ¹x; yº 2 E if and only if ¹.x/; Q.y/º Q 2 E. If both . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.