✦ LIBER ✦

Upper bounds on Roman domination numbers of graphs

✍ Scribed by Chun-Hung Liu; Gerard Jennhwa Chang

Book ID: 113567558
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 284 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.12.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On upper domination Ramsey numbers for g

On upper domination Ramsey numbers for graphs

✍ Michael A. Henning; Ortrud R. Oellermann 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Upper bounds for ƒ-domination number of

Upper bounds for ƒ-domination number of graphs

✍ Beifang Chen; Sanming Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Lower bounds on the signed domination nu

Lower bounds on the signed domination numbers of directed graphs

✍ H. Karami; S.M. Sheikholeslami; Abdollah Khodkar 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Roman domination subdivision number of g

Roman domination subdivision number of graphs

✍ M. Atapour; S. M. Sheikholeslami; Abdollah Khodkar 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 268 KB

On graphs whose domination numbers equal

On graphs whose domination numbers equal their independent domination numbers

✍ Belmannu Devadas Acharya; Purnima Gupta 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 KB

An upper bound for the k-domination numb

An upper bound for the k-domination number of a graph

✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).