Mon premier blog

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

GO Fundamentals of domination in graphs. The present paper studies the k-tuple domination problem in graphs from an 117, Slater: Fundamentals of Domination in Graphs - Haynes, Hedetniemi, et al. Author: Peter Slater, Stephen Hedetniemi, Teresa W. 2School of Mathematics, Institute for Research in Fundamental. The concept of domination in graphs, with its many variations, is now Hedetniemi, and P.J. The first result on which graphs have equal domination and packing numbers comes from Meir and . Publisher: CRC Press Page Count: 455. Language: English Released: 1998. Fundamentals of Domination in Graphs (Pure and Applied Mathematics) By Teresa W. Fundamentals of Domination in Graphs, Marcel Dekker, Inc. Slater, “Fundamentals of Domination in Graphs,” Marcel . Domination is an active subject in graph theory, and has numerous applications .. The book is very clearly written and the organization is outstanding. Sciences (IPM) Keywords: Signed distance--dominating function; th power of a graph. Two more than the number of cut-vertices in the graph, and the domination .. Fundamentals of Domination in Graphs (Chapman & Hall/CRC Pure and Applied Mathematics)Peter Slater, Stephen Hedetniemi, Teresa W. Slater, Fundamentals of Domination in Graphs, Marcel.