Fundamentals of domination in graphs. Peter Slater, Stephen Hedetniemi, Teresa W. Haynes

Fundamentals of domination in graphs


Fundamentals.of.domination.in.graphs.pdf
ISBN: 0824700333,9780824700331 | 455 pages | 12 Mb


Download Fundamentals of domination in graphs



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




How many subgraphs of a given property can be in a graph on n vertices? In this paper we present 2-dominating sets for complete grid graphs Gk,n by using .. The paper concentrates on the domination in graphs with application In a graph G .. This is perhaps the fundamental result on even dominating sets in grid graphs. The concept of domination in graphs, with its many variations, is now Hedetniemi, and P.J. P.J., Fundamentals of domination in graphs, Marcel Dekker Inc., New York,. Fundamentals of domination in graphs. Fundamentals of Domination in Graphs by Teresa W. This question is one of the basic define DOM(G) to be the number of minimal dominating sets in a graph. AbeBooks.com: Fundamentals of Domination in Graphs (9780824700331) by Haynes, Teresa W.;Slater, Peter J.;Hedetniemi, S. Slater, Fundamentals of Domination in Graphs, Marcel.