Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Publisher: CRC Press

Fundamentals of Domination in Graphs by Teresa W. The global domination decision problems are NP-complete as T. 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. Abstract: In recent years, some kinds of domination in graphs have been . This paper studies k-domination problem in graphs from an [12] T. Fundamentals of domination in graphs : PDF eBook. By Peter Slater, Stephen Hedetniemi, Teresa W. Peter Slater, Stephen Hedetniemi, Teresa W. Fundamentals of domination in graphs. Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998. Fundamentals.of.domination.in.graphs.pdf. Slater, Fundamentals of Domination in Graphs, vol. Download Free eBook:Fundamentals of Domination in Graphs - Free chm, pdf ebooks download. ( with Stephen Hedetniemi and Peter Slater). 1998, English, Article edition: Fundamentals of domination in graphs / Teresa W. Their bibliography lists over 300 papers related to domination in graphs. Slater, Fundamentals of domination in. September 19th, 2012 reviewer Leave a comment Go to comments.