𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some Upper Bounds Related with Domination Number

✍ Scribed by Zhao Gu, Jixiang Meng, Zhao Zhang…

Book ID
120888471
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
386 KB
Volume
1
Category
Article
ISSN
2194-668X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Some upper bounds for the product of the
Some upper bounds for the product of the domination number and the chromatic number of a graph
✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Topp, J. and L. Volkmann, Some upper bounds for the product of the domination number and the chromatic number of a graph, Discrete Mathematics 118 (1993) 2899292. Some new upper bounds for yx are proved, where y is the domination number and x is the chromatic number of a graph. All graphs consider