Fundamentals of domination in graphs
Appropriate for use at different levels, Fundamentals of Domination in Graphs includes chapters on basic results and types of domination, domination algorithms and complexity, and frameworks for domination, as well as a host of pedagogical features, such as basic definitions and preliminary graph theoretic results ... end-of-chapter exercises and problems and noteworthy open research problems ... real-world applications in fields from social sciences, optimization, and computer and communication networks to computational complexity and algorithm design ... nearly 400 examples, equations, drawings, and tables illustrating complex concepts ... an appendix listing all known domination-related parameters and notations ... the only comprehensive bibliography of more than 1400 published papers ... and more
Print Book, English, ©1998
Marcel Dekker, New York, ©1998