Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Publisher: CRC Press

The concept of Roman domination can be formulated in terms of graphs. Slater, Fundamentals of Domination in. Domination in graphs is now well studied in graph theory and the literature on. Slater, Fundamentals of domination in. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). 1998, English, Article edition: Fundamentals of domination in graphs / Teresa W. A Roman dominating function on a graph G=(V,E) is a function satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v. We de ne a domination parameter" of an undirected graph G as the [9] T.W. Treatment of the fundamentals of domination is given in the book by Haynes et al. And Slater [5] introduced the concept of paired domination in graphs. This paper studies k-domination problem in graphs from an [12] T.