✦ LIBER ✦

Bounds relating generalized domination parameters

✍ Scribed by Michael A. Henning; Henda C. Swart

Book ID: 103058454
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 732 KB
Volume: 120
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90567-d

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

Upper Bounds for α-Domination Parameters

✍ Andrei Gagarin; Anush Poghosyan; Vadim Zverovich 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 120 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

Continua of stochastic dominance relatio

Continua of stochastic dominance relations for bounded probability distributions

✍ Peter C. Fishburn 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 951 KB

Bounds related to domination in graphs w

✍ Sanchis, Laura A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 2 views

A dominating set for a graph G = (V, E) is a subset of vertices V ⊆ V such that for all v ∈ V -V there exists some u ∈ V for which {v, u} ∈ E. The domination number of G is the size of its smallest dominating set(s). We show that for almost all connected graphs with minimum degree at least 2 and q e

On equality in an upper bound for domina

On equality in an upper bound for domination parameters of graphs

✍ Favaron, O.; Mynhardt, C. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 2 views

We consider the well-known upper bounds µ(G) ≤ |V (G)|-∆(G), where ∆(G) denotes the maximum degree of G and µ(G) the irredundance, domination or independent domination numbers of G and give necessary and sufficient conditions for equality to hold in each case. We also describe specific classes of gr