|
|||||||||||||||||||||||||||||||||||
|
1 Review
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
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. |
|
Most Helpful First | Newest First
|
|
Domination in Graphs (Chapman & Hall/CRC Pure and Applied Mathematics) by Peter Slater (Hardcover - January 5, 1998)
$247.95 $212.09
Usually ships in 1 to 3 weeks | |
 
| ||
