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




Fundamentals of Domination in Graphs, Marcel Dekker, Inc. Fundamentals of domination in graphs. GO Fundamentals of domination in graphs. The basic familiarity with the notion of graphs, the concept of domination and standard algorithmic tools is assumed. Nating set, mixed dominating set. Slater, Fundamentals of Domination in. Ruei-Yuan dominating function assigns 1 and -1 to each ver- . Author: Peter Slater, Stephen Hedetniemi, Teresa W. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mbWritten by three internati. Two well known graph invariants called metric dimension and domination . Fundamentals of Domination in Graphs by Teresa W. The study of domination is one of the fastest growing areas within graph theory. An excellent treatment of the fundamentals of domination is given in the book by. On the Signed Domination Number of Torus Graphs. Publisher: CRC Press Page Count: 455. We de ne a \domination parameter" of an undirected graph G as the [9] T.W. Download eBook "Fundamentals of Domination in Graphs (Chapman & Hall/ CRC Pure and Applied Mathematics)" (ISBN: 0824700333) by Teresa W. Language: English Released: 1998. The (vertex) dominating set problem is one of the fundamental problems in graph theory [3, 8,.