Fundamentals of Domination in Graphs (Chapman & Hall/CRC Pure and Applied Mathematics)

"Written by three internationally respected authorities in the field, this self-contained reference/text provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs;discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness, as well as frameworks for domination that enable the researcher to approach and generalize graph domination from different mathematical perspectives. Appropriate for use at different levels, Fundamentals of Domination in Graphs reinforces the material with a host of learning and pedagogical features, such as basic definitions and preliminary graph theoretic results consistent graph theory terminology throughout the work end-of-chapter exercises and problems as well as 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 and more! Containing the only comprehensive bibliography of more than 1200 published papers, Fundamentals of Domination in Graphs is a valuable reference for applied and discrete mathematicians, computer and systems engineers, communication network specialists, computer and social scientists, and operations researchers, as well as an excellent text for students taking courses, such as Advanced Topics in Graph Theory and Introduction to Graph Theory in departments of mathematics and computer science." 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

provides The First Comprehensive Treatment Of Theoretical, Algorithmic, And Application Aspects Of Domination In Graphs-discussing Fundamental Results And Major Research Accomplishments In An Easy-to-understand Style. Includes Chapters On Domination Algorithms And Np-completeness As Well As Frameworks For Domination.