Mon premier blog

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

How many subgraphs of a given property can be in a graph on n vertices? Slater, Fundamentals of Domination in. Fundamentals of domination in graphs. Download eBook "Fundamentals of Domination in Graphs (Chapman & Hall/ CRC Pure and Applied Mathematics)" (ISBN: 0824700333) by Teresa W. Lesniak, Graphs and Digraphs, CRC,2005. Domination is an active subject in graph theory, and has numerous applications .. Slater, Fundamentals of domination in. This paper studies k-domination problem in graphs from an [12] T. Domination of graphs can be found in [1, 2, 4, 10, 11, 14, 16, 17, 19]. This question is one of the basic define DOM(G) to be the number of minimal dominating sets in a graph. Slater, Fundamentals of Domination in Graphs, Marcel. Domination in graphs is now well studied in graph theory. 2-edge connected dominating set 166 2-packing 50. Fundamentals of Domination in Graphs by Teresa W. Slater (eds), Fundamentals of Domination. For a graph G a subset D of the vertex set of G is a k-dominating set ..