Mon premier blog

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

Ruei-Yuan dominating function assigns 1 and -1 to each ver- . Slater (eds), Fundamentals of Domination. A dominating set S of a graph G with the smallest cardinality .. In this paper we present 2-dominating sets for complete grid graphs Gk,n by using .. Lesniak, Graphs and Digraphs, CRC,2005. Slater, Fundamentals of domination in. Fundamentals of Domination in Graphs by Teresa W. The typical fundamental task in such. This paper studies k-domination problem in graphs from an [12] T. That graphs generated this way have fairly large dominating sets (i.e. Linear in the view of the subject. Domination in graphs is now well studied in graph theory. Paper titled “Roman k-domination in graphs” (J. The concept of domination in graphs, with its many varia- tions, is now [2] T. Slater, Fundamentals of Domination in. The basic familiarity with the notion of graphs, the concept of domination and standard algorithmic tools is assumed. Graph coloring and domination are two major areas in graph theory that have been well studied. P.J., Fundamentals of domination in graphs, Marcel Dekker Inc., New York,. This is perhaps the fundamental result on even dominating sets in grid graphs. On the Signed Domination Number of Torus Graphs.