Fundamentals of domination in graphs pdf
Par mercer frances le jeudi, juillet 28 2016, 01:17 - 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
Harary, Graph theory, Addison-Wesley, Reading Mass (1969). Fundamentals of Domination in Graphs (Pure and Applied Mathematics). Welcome To Ooxsnusualebooks.Soup.Io! Geometry of Cuts and Metrics (Algorithms and Combinatorics). Foundations of Combinatorics with Applications. Slater, Fundamentals of Domination in. Treatment of the fundamentals of domination is given in the book by Haynes et al. And Slater [5] introduced the concept of paired domination in graphs. The basic familiarity with the notion of graphs, the concept of domination and standard algorithmic tools is assumed. We de ne a \domination parameter" of an undirected graph G as the [9] T.W.