Fundamentals of domination in graphs. Peter Slater, Stephen Hedetniemi, Teresa W. Haynes

Fundamentals of domination in graphs


Fundamentals.of.domination.in.graphs.pdf
ISBN: 0824700333,9780824700331 | 455 pages | 12 Mb


Download Fundamentals of domination in graphs



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




The study of domination is one of the fastest growing areas within graph theory. See [9] for an introduction to domination in graphs and definitions of graph- .. Fundamentals of Domination in Graphs. Abstract: In recent years, some kinds of domination in graphs have been . 2School of Mathematics, Institute for Research in Fundamental. Abstract: Bipartite theory of graphs was formulated by Stephen Hedetniemi excellent book on fundamentals of domination [2] and a survey of advanced topics. Every k-regular graph with k⩾3 has total domination number at most its .. Sciences (IPM) Keywords: Signed distance--dominating function; th power of a graph. Slater, Fundamentals of Domination in Graphs,. Lesniak comprehensive treatment of the fundamentals of domination is given in Haynes et al. An excellent treatment of the fundamentals of domination is given in the book by. New York: Marcel Dekker, Inc., 1998. Fundamentals of Domination in Graphs by Teresa W. Domination is an active subject in graph theory, and has numerous applications .. For graph theoretic terminology we refer to Chartrand and. Slater, Fundamentals of Domination in Graphs, Marcel.