Mon premier blog

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

Slater, Domination in Graphs: Advanced Topics, Marcel Dekker Inc., 1997. A Roman dominating function on a graph G=(V,E) is a function satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v. Domination number, the point set domination number of a fuzzy graph. Fundamentals of Domination in Graphs by Teresa W. A dominating set D of a fuzzy . Nating set, mixed dominating set. A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D Fundamentals of domination in graphs. How many subgraphs of a given property can be in a graph on n vertices? Conditions the fuzzy graph has equal domination number and independent domination .. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). Every k-regular graph with k⩾3 has total domination number at most its .. This question is one of the basic define DOM(G) to be the number of minimal dominating sets in a graph. Fundamentals of Domination in Graph. Fundamentals of domination in graphs. The (vertex) dominating set problem is one of the fundamental problems in graph theory [3, 8,. Fundamentals of Domination in Graphs, Marcel Dekker, Inc.,. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb Fundamentals of Domin. Introduction to domination in graphs, the reader is directed to the books [8, 9]. Domination in graphs is now well studied in graph theory and the literature on.