Mon premier blog

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

All the graphs considered in this paper are non-complete and of order n ≥ 2. 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. 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. Results 1 - 10 of 56 CiteSeerX - Scientific documents that cite the following paper: Fundamentals of Domination in Graphs. Slater, Fundamentals of Domination in Graphs, Marcel. For a more thorough study of domination in graphs, see Haynes et al. Fundamentals of Domination in Graphs (Chapman & Hall/CRC Pure and Applied Mathematics)Peter Slater, Stephen Hedetniemi, Teresa W. Slater, Fundamentals of Domination in. Slater, Fundamentals of Domination in Graphs, vol. The first result on which graphs have equal domination and packing numbers comes from Meir and . A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The concept of domination in graphs, with its many varia- tions, is now [2] T. The global domination decision problems are NP-complete as T. Fundamentals of Domination in Graphs: 208 (Chapman & Hall/CRC Pure and Applied Mathematics): Teresa W. Domination is an active subject in graph theory, and has numerous applications .. Harary, “Graph Theory,” Addison-Wesley, Boston, 1969.