✦ LIBER ✦

Dominating functions with integer values in graphs—a survey

✍ Scribed by Li-ying Kang; Er-fang Shan

Book ID: 107482525
Publisher: Chinese Electronic Periodical Services
Year: 2007
Tongue: English
Weight: 281 KB
Volume: 11
Category: Article
ISSN: 1007-6417
DOI: 10.1007/s11741-007-0501-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

k-Domination andk-Independence in Graphs

k-Domination andk-Independence in Graphs: A Survey

✍ Mustapha Chellali; Odile Favaron; Adriana Hansberg; Lutz Volkmann 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 641 KB

Independent domination in graphs: A surv

Independent domination in graphs: A survey and recent results

✍ Goddard, Wayne; Henning, Michael A. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Integer-Valued Analytic Functions in a H

Integer-Valued Analytic Functions in a Half-Plane

✍ James Langley 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 164 KB

[Springer Monographs in Mathematics] Tot

[Springer Monographs in Mathematics] Total Domination in Graphs || Graphs with Disjoint Total Dominating Sets

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2013 🏛 Springer New York ⚖ 159 KB

Domination in a graph with a 2-factor

✍ Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

## Abstract Let γ(__G__) be the domination number of a graph __G__. Reed 6 proved that every graph __G__ of minimum degree at least three satisfies γ(__G__) ≤ (3/8)|__G__|, and conjectured that a better upper bound can be obtained for cubic graphs. In this paper, we prove that a 2‐edge‐connected cu

A parity domination problem in graphs wi

A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

✍ Elisabeth Gassner; Johannes Hatzl 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 268 KB