𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bounds for α-Domination Parameters

✍ Scribed by Andrei Gagarin; Anush Poghosyan; Vadim Zverovich

Book ID
106047803
Publisher
Springer Japan
Year
2009
Tongue
English
Weight
120 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Upper bounds on the paired-domination nu
Upper bounds on the paired-domination number
✍ Xue-gang Chen; Wai Chee Shiu; Wai Hong Chan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 199 KB

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paireddomination number of G, denoted by γ pr (G). In this w

An Upper Bound for the Independent Domin
An Upper Bound for the Independent Domination Number
✍ Liang Sun; Jianfang Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.