Mon premier blog

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

Slater, Fundamentals of Domination in Graphs, Marcel. Data Reduction for Domination in Graphs. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb. See [9] for an introduction to domination in graphs and definitions of graph- .. Fundamentals of Domination in Graphs by Teresa W. Fundamentals of Domination in Graphs Marcel Dekker, Inc., New York. (2004; Alber, Fellows For instance, for an n-vertex graph its optimization version is known to be polynomial-time approximable only up . Slater, Fundamentals of Domination in. Paper titled “Roman k-domination in graphs” (J. In this paper we present 2-dominating sets for complete grid graphs Gk,n by using .. The first result on which graphs have equal domination and packing numbers comes from Meir and . P.J., Fundamentals of domination in graphs, Marcel Dekker Inc., New York,. The concept of domination in graphs, with its many variations, is now Hedetniemi, and P.J. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on Fundamentals of Domination in Graphs. Slater, Fundamentals of Domination in Graphs,. A connected fuzzy graph is arc insensitive if the domination number is unchanged ..