Mon premier blog

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

Slater, Fundamentals of Domination in Graphs, vol. Lesniak, Graphs and Digraphs, CRC,2005. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb. Slater, Fundamentals of Domination in Graphs,. A NOTE ON SIGNED CYCLE DOMINATION IN GRAPHS . The global domination decision problems are NP-complete as T. A Roman dominating function on a graph G=(V,E) is a function satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v. Download eBook "Fundamentals of Domination in Graphs (Chapman & Hall/ CRC Pure and Applied Mathematics)" (ISBN: 0824700333) by Teresa W. 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. Fundamentals of Domination in Graphs by Teresa W. The present paper studies the k-tuple domination problem in graphs from an 117, Slater: Fundamentals of Domination in Graphs - Haynes, Hedetniemi, et al.