Fundamentals of domination in graphs ebook
Par lombardo daniel le dimanche, juillet 17 2016, 16:36 - Lien permanent
Fundamentals of domination in graphs. Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Fundamentals.of.domination.in.graphs.pdf
ISBN: 0824700333,9780824700331 | 455 pages | 12 Mb
Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes
Publisher: CRC Press
Fundamentals of domination in graphs. Fundamentals.of.domination.in.graphs.pdf. Domination of graphs can be found in [1, 2, 4, 10, 11, 14, 16, 17, 19]. Domination graph theory is the most popular topic for research. Peter Slater, Stephen Hedetniemi, Teresa W. Slater, Fundamentals of Domination in Graphs, Marcel. The first result on which graphs have equal domination and packing numbers comes from Meir and . The concept of domination in graphs, with its many variations, is now Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Monogr. Harary, “Graph Theory,” Addison-Wesley, Boston, 1969. Results 1 - 10 of 56 CiteSeerX - Scientific documents that cite the following paper: Fundamentals of Domination in Graphs. Apr 1, 2012 Fundamentals of Domination in Graphs by Teresa W. Fundamentals of Domination in Graphs by Teresa W.