✦ LIBER ✦

Restricted domination parameters in graphs

✍ Scribed by Wayne Goddard; Michael A. Henning

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 249 KB
Volume: 13
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9037-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inequalities relating domination paramet

Inequalities relating domination parameters in cubic graphs

✍ Michael A. Henning; Peter J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 787 KB

The Domination Parameters of Cubic Graph

The Domination Parameters of Cubic Graphs

✍ Igor E. Zverovich; Vadim E. Zverovich 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 318 KB

Chessboard graphs, related designs, and

Chessboard graphs, related designs, and domination parameters

✍ Renu Laskar; Charles Wallis 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 162 KB

The graph-theoretic study of combinatorial chessboard problems can be extended to the study of line graphs of graphs of combinatorial designs. In particular, the determination of optimal placements of rooks on a chessboard corresponds to the determination of domination parameters of graphs of block

Generalized domination and efficient dom

Generalized domination and efficient domination in graphs

✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

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

Paired-domination in graphs

✍ Haynes, Teresa W.; Slater, Peter J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

In a graph G Å (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then ''domination'' requires every vertex to be protected. Thus, S ʚ V (G) is a dominating set if ʜ s √ S N[s] Å V (G). For total domination, eac

Set domination in graphs

✍ E. Sampathkumar; L. Pushpa Latha 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract Let __G__ = (__V, E__) be a connected graph. A set __D__ ⊂ __V__ is a __set‐dominating set__ (sd‐set) if for every set __T__ ⊂ __V__ − __D__, there exists a nonempty set __S__ ⊂ __D__ such that the subgraph 〈__S__ ∪ __T__〉 induced by __S__ ∪ __T__ is connected. The set‐domination number