✦ LIBER ✦

Three conjectures on the signed cycle domination in graphs

✍ Scribed by Jian Guan, Xiaoyan Liu, Changhong Lu, Zhengke Miao

Book ID: 120694169
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 371 KB
Volume: 25
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9506-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Signed Domination in Graphs

✍ Jiří Matoušek 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 144 KB

Some Notes on Signed Edge Domination in

Some Notes on Signed Edge Domination in Graphs

✍ H. Karami; S. M. Sheikholeslami; A. Khodkar 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 99 KB

On the complexity of signed and minus to

On the complexity of signed and minus total domination in graphs

✍ Chuan-Min Lee 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 167 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

A lower bound on the total signed domina

A lower bound on the total signed domination numbers of graphs

✍ Xin-zhong Lu 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 172 KB

Proof of a conjecture on -tuple dominati

Proof of a conjecture on -tuple domination in graphs

✍ Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Let G = (V, E) be a graph and N G [v] the closed neighborhood of a vertex v in G. For k ∈ N, the minimum cardinality of a set In this note we prove the following conjecture of Rautenbach and Volkmann [D. Rautenbach, L. Volkmann, New bounds on the k-domination number and the k-tuple domination numbe