Superpower graphs of finite abelian groups

HIGHLIGHTS

• What: The aim of this paper is to provide the tight bounds for the vertex connectivity of S(G) together with some structural properties like maximal domination set Hamiltonicity and its variations of superpower graph of finite abelian groups. In the following theorem, the authors provide a lower bound for the vertex connectivity κ(S(G)) of S(G) for any finite abelian group G which extend Theorem 2.7[9] and_[Theorem 2.11[8].
• Who: AJAY KUMAR and colleagues from the Revista de la Unión Matemática Argentina have published the Article: SUPERPOWER . . .
  

   

  

  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.