✦ LIBER ✦

Roman domination subdivision number of graphs

✍ Scribed by M. Atapour; S. M. Sheikholeslami; Abdollah Khodkar

Publisher: Springer
Year: 2009
Tongue: English
Weight: 268 KB
Volume: 78
Category: Article
ISSN: 0001-9054
DOI: 10.1007/s00010-009-2981-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paired-Domination Subdivision Numbers of

Paired-Domination Subdivision Numbers of Graphs

✍ O. Favaron; H. Karami; S. M. Sheikholeslami 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 153 KB

On the total domination subdivision numb

On the total domination subdivision number in some classes of graphs

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 302 KB

Bounding the total domination subdivisio

Bounding the total domination subdivision number of

✍ Odile Favaron; Hossein Karami; Seyyed Mahmoud Sheikholeslami 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 329 KB

Disproof of a Conjecture on the Subdivis

Disproof of a Conjecture on the Subdivision Domination Number of a Graph

✍ O. Favaron; H. Karami; S. M. Sheikholeslami 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 93 KB

An Upper Bound for the Total Domination

An Upper Bound for the Total Domination Subdivision Number of a Graph

✍ H. Karami; R. Khoeilar; S. M. Sheikholeslami; A. Khodkar 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 130 KB

Note on 2-rainbow domination and Roman d

Note on 2-rainbow domination and Roman domination in graphs

✍ Yunjian Wu; Huaming Xing 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = v∈V f (v) over all such functions is called the Roman domination number γ R (G). A 2-rainbow dominating function of a graph G is a function g that