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

A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every vertex of G is adjacent to some vertex in S. ISBN: 0824700333, 9780824700331, 9780585388953. Slater, Fundamentals of Domination in Graphs, Marcel. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb. Fundamentals of domination in graphs. Slater (eds), Fundamentals of Domination. Peter Slater, Stephen Hedetniemi, Teresa W. Domination is an active subject in graph theory, and has numerous applications .. Domination in graphs is now well studied in graph theory. Fundamentals of Domination in Graphs by Teresa W. As a generalization of connected domination in a graph G we consider domination by .. 2-edge connected dominating set 166 2-packing 50. Slater “Fundamentals of Domination in Graphs", Marcel Dekker, Inc New York, 1998. Every k-regular graph with k⩾3 has total domination number at most its .. Slater: Fundamentals of domination in graphs.