Fundamentals of domination in graphs ebook download
Par clements rodney le jeudi, novembre 19 2015, 21:46 - Lien permanent
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
Page: 455
Format: djvu
ISBN: 0824700333, 9780824700331
Publisher: CRC Press
The first result on which graphs have equal domination and packing numbers comes from Meir and . An excellent treatment of the fundamentals of domination is given in the book by. The basic familiarity with the notion of graphs, the concept of domination and standard algorithmic tools is assumed. 2-edge connected dominating set 166 2-packing 50. Haynes T.W., Hedentiemi S.T., Slater P.J. Slater, Fundamentals of domination in graphs,. A dominating set S of a graph G with the smallest cardinality .. In this paper we introduce the equitable edge domination in a graph, .. Fundamentals of Domination in Graphs by Teresa W. Slater, Fundamentals of Domination in Graphs, Marcel. Fundamentals of domination in graphs. The study of domination is one of the fastest growing areas within graph theory. The concept of domination in graphs, with its many variations, is now Hedetniemi, and P.J.