Protection of complete multipartite graphs

Authors

  • Benecke S.
  • Grobler P.J.P.
  • Van Vuuren J.H.

Abstract

The notion of higher order domination in graphs has been studied in the literature and may be categorised as so-called finite higher order domination and infinite higher order domination. The former concept concerns the protection of a graph against a finite number of attacks, while the latter caters for an infinite number of attacks. Although the infinite order domination parameters have been established for the complete multipartite graph K p1,p2,...,pt, only the secure finite order parameters were resolved, and only for the complete bipartite case. In this paper, both the smart and foolproof versions (which are equal in this case) of the secure and weak Roman higher order domination parameters are fully established for the complete multipartite graph.

Published

2006-09-09

How to Cite

Benecke S., Grobler P.J.P., & Van Vuuren J.H. (2006). Protection of complete multipartite graphs. Utilitas Mathematica, 71. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/409

Issue

Vol. 71 (2006): Volume 71, 2006

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.