✦ LIBER ✦

Bounds on the Total Restrained Domination Number of a Graph

✍ Scribed by J. H. Hattingh; E. Jonck; E. J. Joubert

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 326 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0894-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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

An upper bound on the total restrained d

An upper bound on the total restrained domination number of a tree

✍ Johannes H. Hattingh; Elizabeth Jonck; Ernst J. Joubert 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 529 KB

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

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

On the r-domination number of a graph

✍ Jerrold R. Griggs; Joan P. Hutchinson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 468 KB

For r > 0, let the r-domination number of a graph, d,, be the size of a smallest set of vertices such that every vertex of the graph is within distance r of a vertex in that set. This paper contains proofs that every graph with a spanning tree with at least n/2 leaves has d, s n/(2r); this compares