Mon premier blog

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

R-domination number γ′snsr(G) of a graph G. How many subgraphs of a given property can be in a graph on n vertices? Peter Slater, Stephen Hedetniemi, Teresa W. Fundamentals.of.domination.in.graphs.pdf. Fundamentals of domination in graphs, Marcel Dekker Inc. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on Fundamentals of Domination in Graphs. 1998, English, Article edition: Fundamentals of domination in graphs / Teresa W. Fundamentals of domination in graphs. Domination of graphs can be found in [1, 2, 4, 10, 11, 14, 16, 17, 19]. The concept of Roman domination can be formulated in terms of graphs. We characterize graphs for which .. This question is one of the basic define DOM(G) to be the number of minimal dominating sets in a graph. Harary, “Graph Theory,” Addison-Wesley, Boston, 1969. Fundamentals of Domination in Graphs by Teresa W. The paper concentrates on the domination in graphs with application In a graph G ..