Mon premier blog

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

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. Slater, Fundamentals of Domination in Graphs, vol. Fundamentals of Domination in Graphs, Marcel. Fundamentals of Domination in Graphs by Teresa W. The global domination decision problems are NP-complete as T. For a more thorough study of domination in graphs, see Haynes et al. Haynes T.W., Hedentiemi S.T., Slater P.J. Fundamentals of domination in graphs. Slater, Fundamentals of Domination in. ISBN: 0824700333, 9780824700331, 9780585388953. The concept of domination in graphs, with its many varia- tions, is now [2] T. Key Words: Domination, Domination number, Double domination, double domination .. 2-edge connected dominating set 166 2-packing 50.