"Presents the latest in graph domination by leading researchers from around the world-furnishing known results, open research problems, and proof techniques. Maintains standardized terminology and notation throughout for greater accessibility. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on chessboards, and more."
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Review
. . .well written and informative. Each chapter contains a wealth of information.
---Mathematical Reviews
---Mathematical Reviews
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
2 of 2 people found the following review helpful:
4.0 out of 5 stars
intricate and rigorous chapters,
By
This review is from: Domination in Graphs (Chapman & Hall/CRC Pure and Applied Mathematics) (Hardcover)
The editors have collected a set of research papers on graph domination. This book is a companion to "Fundamentals of Domination in Graphs" by the same editors. Readers might well want to consult both books.
The book is best suited to a reader majoring in maths or computer science. The chapters are very theoretical and can be dense reading. Theorems are stated and proved rigorously. Which is as it should be. Except that this scarcely makes for quick reading. In some instances, the results or subject of a chapter can be easily described. Like where we have a graph G=(V,E) of vertices V and edges E. And there is a subset S of vertices. S is defined to be k-dominating if every vertex in V-S is within k hops of a vertex in S. One chapter gives results for this distance domination of graphs.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Abstract. This chapter describes in matrix form many graph theoretic subset problems such as domination, packing, covering, and independence. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
domatic number, efficient dominating set, domination algorithms, domatic partition, fractional domination, total dominating set, chessboard graphs, irredundance number, minimal dominating function, perfect dominating set, irredundant function, signed domination number, total domination number, minus domination, minimum weight dominating set, rooks graph, domination parameters, independent dominating set, open irredundance, orderable graphs, perfect critical digraphs, connected block graph, dominating clique, saturated vertices, trapezoid graphs Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, Discrete Appl, Technical Report, Ars Combin, Clemson University, Computer Science, Department of Mathematics, New York, Pushpa Latha, John Wiley, Mathematical Sciences, Pandu Rangan, Von Neumann, Pure Appl, University of South Africa, Fundamentals of Domination, University of Central Florida, Scientific Amer, Theory Ser, Algebraic Discrete Methods, Ars Combzn, Iasi Sect, International Workshop, Marcel Dekker, Masters Thesis New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Abstract. This chapter describes in matrix form many graph theoretic subset problems such as domination, packing, covering, and independence. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
domatic number, efficient dominating set, domination algorithms, domatic partition, fractional domination, total dominating set, chessboard graphs, irredundance number, minimal dominating function, perfect dominating set, irredundant function, signed domination number, total domination number, minus domination, minimum weight dominating set, rooks graph, domination parameters, independent dominating set, open irredundance, orderable graphs, perfect critical digraphs, connected block graph, dominating clique, saturated vertices, trapezoid graphs Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, Discrete Appl, Technical Report, Ars Combin, Clemson University, Computer Science, Department of Mathematics, New York, Pushpa Latha, John Wiley, Mathematical Sciences, Pandu Rangan, Von Neumann, Pure Appl, University of South Africa, Fundamentals of Domination, University of Central Florida, Scientific Amer, Theory Ser, Algebraic Discrete Methods, Ars Combzn, Iasi Sect, International Workshop, Marcel Dekker, Masters Thesis New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 53
books:
See all 53 books this book cites
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel on 6 pages
- Applications of Discrete Mathematics by Richard D. Ringeisen on page 58, page 129, and page 267
- Set Theory by Thomas Jech in Front Matter (1), and Front Matter (2)
- Fundamentals of Pattern Recognition (Chapman & Hall/CRC Pure and Applied Mathematics) by Monique L. Pavel in Front Matter (1), and Front Matter (2)
- Topics on Domination (Annals of Discrete Mathematics) by S.T. Hedetniemi on page 401, and page 434
See all 53 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
