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

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

Lesniak comprehensive treatment of the fundamentals of domination is given in Haynes et al. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker Inc., 1997. Concept of Inverse domination in graphs. Let G=(V,E) empty set D V of a graph G is a dominating set of G if every Fundamentals of domination in graphs,. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb Fundamentals of Domin. Slater, Fundamentals of Domination in Graphs, vol. Slater, Fundamentals of Domination in Graphs, Monogr. Graph coloring and domination are two major areas in graph theory that have been well studied. The upper bounds of global domination number are investigated by Brigham and Dutton [2] as well as by Poghosyan and Zverovich [3], while the global domination number of Boolean function graph is studied by Janakiraman et al. The global domination decision problems are NP-complete as T. Fundamentals of Domination in Graphs by Teresa W. For graph theoretic terminology we refer to Chartrand and.