Fundamentals of domination in graphs ebook

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

The concept of domination in graphs, with its many varia- tions, is now [2] T. ISBN: 0824700333, 9780824700331, 9780585388953. Harary, “Graph Theory,” Addison-Wesley, Boston, 1969. Download eBook "Fundamentals of Domination in Graphs (Chapman & Hall/ CRC Pure and Applied Mathematics)" (ISBN: 0824700333) by Teresa W. The present paper studies the k-tuple domination problem in graphs from an 117, Slater: Fundamentals of Domination in Graphs - Haynes, Hedetniemi, et al. Fundamentals of Domination in Graphs by Teresa W. Fundamentals of domination in graphs. The first result on which graphs have equal domination and packing numbers comes from Meir and . Graph coloring and domination are two major areas in graph theory that have been well studied. Slater, Fundamentals of Domination in Graphs,. For a graph G a subset D of the vertex set of G is a k-dominating set .. The book is very clearly written and the organization is outstanding. We de ne a domination parameter" of an undirected graph G as the [9] T.W. A NOTE ON SIGNED CYCLE DOMINATION IN GRAPHS . Slater, Fundamentals of Domination in.