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
Publisher: CRC Press
Page: 455
Format: djvu
ISBN: 0824700333, 9780824700331

Peter Slater, Stephen Hedetniemi, Teresa W. Fundamentals.of.domination.in.graphs.pdf. As a generalization of connected domination in a graph G we consider domination by .. The global domination decision problems are NP-complete as T. Haynes T.W., Hedentiemi S.T., Slater P.J. Slater, Fundamentals of Domination in Graphs, vol. Fundamentals of domination in graphs. Fundamentals of Domination in Graphs by Teresa W. Harary, Graph theory, Addison-Wesley, Reading Mass (1969). Slater: Fundamentals of domination in graphs. Harary, “Graph Theory,” Addison-Wesley, Boston, 1969. 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. This question is one of the basic define DOM(G) to be the number of minimal dominating sets in a graph. Lesniak comprehensive treatment of the fundamentals of domination is given in Haynes et al. How many subgraphs of a given property can be in a graph on n vertices? For graph theoretic terminology we refer to Chartrand and. Domination of graphs can be found in [1, 2, 4, 10, 11, 14, 16, 17, 19].