This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called
Domination in graphs: advanced topics
โ Scribed by Teresa W. Haynes, Stephen Hedetniemi, Peter Slater
- Book ID
- 127454487
- Publisher
- Marcel Dekker
- Year
- 1997
- Tongue
- English
- Weight
- 4 MB
- Series
- Monographs and textbooks in pure and applied mathematics 209
- Edition
- 1
- Category
- Library
- City
- New York
- ISBN
- 0585285241
No coin nor oath required. For personal study only.
โฆ Synopsis
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!
๐ SIMILAR VOLUMES