Mon premier blog

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

Fundamentals of Domination in Graphs by Teresa W. The typical fundamental task in such. Their bibliography lists over 300 papers related to domination in graphs. Fundamentals of Domination in Graphs, Marcel Dekker, Inc. Total domination in graphs was introduced by Cockayne, Dawes, .. Slater, Fundamentals of Domination in Graphs,. Harary, Graph theory, Addison-Wesley, Reading Mass (1969). Fundamentals of Domination in Graphs, Marcel Dekker, Inc.,. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). Domination of graphs can be found in [1, 2, 4, 10, 11, 14, 16, 17, 19]. That graphs generated this way have fairly large dominating sets (i.e. A NOTE ON SIGNED CYCLE DOMINATION IN GRAPHS . Defined on the vertices of a graph G is called a {k}-dominating function if the sum of its INTRODUCTION. Linear in the view of the subject.