✦ LIBER ✦

Upper signed domination number

✍ Scribed by Huajun Tang; Yaojun Chen

Book ID: 108113846
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 132 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.06.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper signed k-domination in a general g

Upper signed k-domination in a general graph

✍ Dejan Delić; Changping Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Bounds on the signed domination number o

Bounds on the signed domination number of a graph

✍ Ruth Haas; Thomas B. Wexler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Lower bounds on several versions of sign

Lower bounds on several versions of signed domination number

✍ Weidong Chen; Enmin Song 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 174 KB

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 Related with Dominatio

Some Upper Bounds Related with Domination Number

✍ Zhao Gu, Jixiang Meng, Zhao Zhang… 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 386 KB

Signed domination in regular graphs

✍ Odile Favaron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 456 KB

In answer to the open questions proposed by Henning and Slater, we give sharp upper bounds on the upper signed domination number of a regular graph and on the signed domination number of a connected cubic graph. Let G = (V, E) be a simple graph. For v E V, we denote by d(u) the degree of v in V, by