Fundamentals of domination in graphs by Peter Slater, Stephen Hedetniemi, Teresa W. Haynes

Fundamentals of domination in graphs



Fundamentals of domination in graphs download




Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes ebook
Publisher: CRC Press
ISBN: 0824700333, 9780824700331
Page: 455
Format: djvu


Slater: Fundamentals of domination in graphs. Slater, Fundamentals of Domination in. Fundamentals of Domination in Graphs (Pure and Applied Mathematics) By Teresa W. Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998. The concept of Roman domination can be formulated in terms of graphs. ( with Stephen Hedetniemi and Peter Slater). Their bibliography lists over 300 papers related to domination in graphs. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb Fundamentals of Domin. Fundamentals of Domination in Graphs by Teresa W. 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. Every k-regular graph with k⩾3 has total domination number at most its .. Paper titled “Roman k-domination in graphs” (J. The first result on which graphs have equal domination and packing numbers comes from Meir and . As a generalization of connected domination in a graph G we consider domination by ..