Teresa W. Haynes - Böcker
Visar alla böcker från författaren Teresa W. Haynes. Handla med fri frakt och snabb leverans.
11 produkter
11 produkter
3 726 kr
Skickas inom 10-15 vardagar
"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."
504 kr
Skickas inom 10-15 vardagar
This second volume in a two-volume series provides an extensive collection of conjectures and open problems in graph theory.
641 kr
Skickas inom 10-15 vardagar
The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas.
696 kr
Skickas inom 5-8 vardagar
The focus is on primary dominating sets such as paired domination, connected domination, restrained domination, dominating functions, Roman domination, and power domination.
696 kr
Skickas inom 5-8 vardagar
The focus is on primary dominating sets such as paired domination, connected domination, restrained domination, dominating functions, Roman domination, and power domination.
965 kr
Skickas
The first part focuses on several domination-related concepts: broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination and spectral graph theory.
1 276 kr
Skickas inom 10-15 vardagar
The first part focuses on several domination-related concepts: broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination and spectral graph theory.
1 804 kr
Skickas inom 10-15 vardagar
The focusedcoverage also provides a good basis for seminars in domination theory or domination algorithms and complexity.The authors set out to provide the community with an updated and comprehensive treatment on the major topics in domination in graphs.
634 kr
Skickas inom 5-8 vardagar
1 804 kr
Skickas inom 10-15 vardagar
The focusedcoverage also provides a good basis for seminars in domination theory or domination algorithms and complexity.The authors set out to provide the community with an updated and comprehensive treatment on the major topics in domination in graphs.
694 kr
Skickas inom 10-15 vardagar
This second volume in a two-volume series provides an extensive collection of conjectures and open problems in graph theory. It is designed for both graduate students and established researchers in discrete mathematics who are searching for research ideas and references. Each chapter provides more than a simple collection of results on a particular topic; it captures the reader’s interest with techniques that worked and failed in attempting to solve particular conjectures. The history and origins of specific conjectures and the methods of researching them are also included throughout this volume. Students and researchers can discover how the conjectures have evolved and the various approaches that have been used in an attempt to solve them. An annotated glossary of nearly 300 graph theory parameters, 70 conjectures, and over 600 references is also included in this volume. This glossary provides an understanding of parameters beyond their definitions and enables readers to discover new ideas and new definitions in graph theory. The editors were inspired to create this series of volumes by the popular and well-attended special sessions entitled “My Favorite Graph Theory Conjectures,” which they organized at past AMS meetings. These sessions were held at the winter AMS/MAA Joint Meeting in Boston, January 2012, the SIAM Conference on Discrete Mathematics in Halifax in June 2012, as well as the winter AMS/MAA Joint Meeting in Baltimore in January 2014, at which many of the best-known graph theorists spoke. In an effort to aid in the creation and dissemination of conjectures and open problems, which is crucial to the growth and development of this field, the editors invited these speakers, as well as other experts in graph theory, to contribute to this series.