Fundamentals of domination in graphs by Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes ebook
Publisher: CRC Press
ISBN: 0824700333, 9780824700331
The basic familiarity with the notion of graphs, the concept of domination and standard algorithmic tools is assumed. 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. Fundamentals of Domination in Graphs. Harary, Graph theory, Addison-Wesley, Reading Mass (1969). Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb Fundamentals of Domin. New York: Marcel Dekker, Inc., 1998. Fundamentals of Domination in Graphs by Teresa W. In this paper we introduce the equitable edge domination in a graph, .. Nating set, mixed dominating set. The paper concentrates on the domination in graphs with application In a graph G .. The (vertex) dominating set problem is one of the fundamental problems in graph theory [3, 8,. Apr 1, 2012 Fundamentals of Domination in Graphs by Teresa W. Slater, Fundamentals of domination in graphs,. Download Free eBook:Fundamentals of Domination in Graphs - Free chm, pdf ebooks download. Domination graph theory is the most popular topic for research. 1998, English, Article edition: Fundamentals of domination in graphs / Teresa W.