✦ LIBER ✦

A note on the lower bounds of signed domination number of a graph

✍ Scribed by Zhongfu Zhang; Baogen Xu; Yinzhen Li; Linzhong Liu

Book ID: 108316289
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 159 KB
Volume: 195
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00189-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

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

Bounds on the -domination number of a gr

Bounds on the -domination number of a graph

✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

Bounds on the Distance Two-Domination Nu

Bounds on the Distance Two-Domination Number of a Graph

✍ N. Sridharan; V.S.A. Subramanian; M.D. Elias 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 122 KB