Learn More
The previously studied notions of smart and foolproof finite order domination of a simple graph G = (V, E) are generalised in the sense that safe configurations in G are not merely sought after k ≥ 1(More)
The (previously studied) notions of secure domination and of weak Roman domination involve the construction of protection strategies in a simple graph G = (V, E), by utilising the minimum number of(More)
  • 1