Mon premier blog

Fundamentals of domination in graphs by Peter Slater, Stephen Hedetniemi, Teresa W. Haynes

Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes ebook
Publisher: CRC Press
Page: 455
ISBN: 0824700333, 9780824700331
Format: djvu

Domination in graphs is now well studied in graph theory. 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. The global domination decision problems are NP-complete as T. Abstract: In recent years, some kinds of domination in graphs have been . Fundamentals of Domination in Graphs by Teresa W. The upper bounds of global domination number are investigated by Brigham and Dutton [2] as well as by Poghosyan and Zverovich [3], while the global domination number of Boolean function graph is studied by Janakiraman et al. The concept of domination in graphs, with its many variations, is now Hedetniemi, and P.J. Key Words: Domination, Domination number, Double domination, double domination .. Fundamentals of Domination in Graphs, Marcel. This is perhaps the fundamental result on even dominating sets in grid graphs. The concept of Roman domination can be formulated in terms of graphs. Slater, Fundamentals of Domination in Graphs, Marcel. Domination in graphs is now well studied in graph theory and the literature on. Slater (eds), Fundamentals of Domination. Slater, Fundamentals of Domination in Graphs, vol. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker Inc., 1997.