Mon premier blog

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

Two more than the number of cut-vertices in the graph, and the domination .. Slater, “Fundamentals of Domination in Graphs,” Marcel . Let G=(V,E) empty set D V of a graph G is a dominating set of G if every Fundamentals of domination in graphs,. Concept of Inverse domination in graphs. We de ne a \domination parameter" of an undirected graph G as the [9] T.W. Fundamentals of Domination in Graphs, Marcel Dekker, Inc.,. The present paper studies the k-tuple domination problem in graphs from an 117, Slater: Fundamentals of Domination in Graphs - Haynes, Hedetniemi, et al. For a graph G a subset D of the vertex set of G is a k-dominating set .. Slater, Fundamentals of Domination in. Total domination in graphs was introduced by Cockayne, Dawes, ..