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

Fundamentals of domination in graphs



Fundamentals of domination in graphs download




Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes ebook
Page: 455
ISBN: 0824700333, 9780824700331
Format: djvu
Publisher: CRC Press


September 19th, 2012 reviewer Leave a comment Go to comments. New York: Marcel Dekker, Inc., 1998. In the standard definition of domination in graphs, a vertex u dominates itself .. Slater, Fundamentals of domination. And Slater P.J.: Fundamentals of domination in Graphs. For a graph G a subset D of the vertex set of G is a k-dominating set .. Haynes T.W., Hedentiemi S.T., Slater P.J. In this paper we discuss (1,2) – domination in different graphs and results .. 2School of Mathematics, Institute for Research in Fundamental. The first result on which graphs have equal domination and packing numbers comes from Meir and . Fundamentals of Domination in Graphs. Fundamentals of Domination in Graphs, Marcel Dekker, Inc. Slater, Fundamentals of Domination in. Fundamentals of domination in graphs : PDF eBook. Sciences (IPM) Keywords: Signed distance--dominating function; th power of a graph. By Peter Slater, Stephen Hedetniemi, Teresa W. Slater “Fundamentals of Domination in Graphs", Marcel Dekker, Inc New York, 1998.