loading 
register   login

Domination in Graphs: Advanced Topics

by: Teresa W. Haynes, Stephen Hedetniemi, Peter Slater
en | CRC

9780824700348  0824700341  9780585285245 

Domination in Graphs (Pure and Applied Mathematics)
By Teresa W. Haynes, Stephen Hedetniemi, Peter Slater




Product Description:

Responding to the increasing interest in, and demand for, in-depth publications in the field, this stimulating, new resource presents the latest in graph domination by leading researchers from around the world;furnishing known results, open research problems, and proof techniques. Maintaining standardized terminology and notation throughout for greater accessibility, Domination in Graphs covers recent developments in domination in graphs and digraphs dominating functions combinatorial problems on chessboards Vizing's conjecture domination algorithms and complexity varieties of domination domatic numbers changing and unchanging domination numbers and more!




Summary: intricate and rigorous chapters
Rating: 4

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.