Irregular domination graphs

HIGHLIGHTS

• who: Mathematics Subject Classification et al. from the Department of, Western Michigan University, Kalamazoo, Michigan, USA have published the paper: Irregular domination graphs, in the Journal: (JOURNAL)
• what: The authors determine all paths and cycles that are irregular domination graphs as well as the familiar graphs of ladders and prisms which are Cartesian products of K2 with paths and cycles respectively. The authors show that H is an irregular domination graph if and only if H is disconnected or H=P4. Next, the authors show that for each integer n ≥ 7, there is a graph . . .
  

   

  

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

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

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