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

Fundamentals of domination in graphs


Fundamentals.of.domination.in.graphs.pdf
ISBN: 0824700333,9780824700331 | 455 pages | 12 Mb


Download Fundamentals of domination in graphs



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




Their bibliography lists over 300 papers related to domination in graphs. Fundamentals of Domination in Graphs - Teresa W. This paper studies k-domination problem in graphs from an [12] T. Fundamentals of domination in graphs, Marcel Dekker Inc. 2-edge connected dominating set 166 2-packing 50. Haynes T.W., Hedentiemi S.T., Slater P.J. Fundamentals of Domination in Graphs by Teresa W. We characterize graphs for which .. Domination in Graphs: Volume 2: Advanced Topics. A dominating set S of a graph G with the smallest cardinality .. All the graphs considered in this paper are non-complete and of order n ≥ 2. Slater, Fundamentals of domination in. R-domination number γ′snsr(G) of a graph G.