Mon premier blog

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

Nating set, mixed dominating set. The (vertex) dominating set problem is one of the fundamental problems in graph theory [3, 8,. Fundamentals of Domination in Graphs by Teresa W. Their bibliography lists over 300 papers related to domination in graphs. Apr 1, 2012 Fundamentals of Domination in Graphs by Teresa W. In the standard definition of domination in graphs, a vertex u dominates itself .. Introduction to domination in graphs, the reader is directed to the books [8, 9]. Fundamentals of domination in graphs. The first result on which graphs have equal domination and packing numbers comes from Meir and . Results 1 - 10 of 56 CiteSeerX - Scientific documents that cite the following paper: Fundamentals of Domination in Graphs. Abstract: Bipartite theory of graphs was formulated by Stephen Hedetniemi excellent book on fundamentals of domination [2] and a survey of advanced topics. Slater, Fundamentals of domination. Harary, Graph theory, Addison-Wesley, Reading Mass (1969). Domination graph theory is the most popular topic for research. Fundamentals of Domination in Graphs: 208 (Chapman & Hall/CRC Pure and Applied Mathematics): Teresa W.