✦ LIBER ✦

A lower bound on the total signed domination numbers of graphs

✍ Scribed by Xin-zhong Lu

Publisher: SP Science China Press
Year: 2007
Tongue: English
Weight: 172 KB
Volume: 50
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-007-0053-0

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

Bounds on the Total Restrained Dominatio

Bounds on the Total Restrained Domination Number of a Graph

✍ J. H. Hattingh; E. Jonck; E. J. Joubert 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 326 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

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

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A lower bound on the independence number

A lower bound on the independence number of a graph

✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~