Fundamentals of domination in graphs book
Par schneider bennie le dimanche, juin 12 2016, 23:18 - Lien permanent
Fundamentals of domination in graphs by Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Download eBook
Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes ebook
Page: 455
Publisher: CRC Press
Format: djvu
ISBN: 0824700333, 9780824700331
The concept of Roman domination can be formulated in terms of graphs. Lesniak comprehensive treatment of the fundamentals of domination is given in Haynes et al. Slater: Fundamentals of domination in graphs. Slater, Fundamentals of domination in. This paper studies k-domination problem in graphs from an [12] T. This is perhaps the fundamental result on even dominating sets in grid graphs. A dominating set S of a graph G with the smallest cardinality .. In the standard definition of domination in graphs, a vertex u dominates itself .. Graph coloring and domination are two major areas in graph theory that have been well studied. Slater “Fundamentals of Domination in Graphs", Marcel Dekker, Inc New York, 1998. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on Fundamentals of Domination in Graphs. Slater, Fundamentals of domination. For graph theoretic terminology we refer to Chartrand and. As a generalization of connected domination in a graph G we consider domination by ..