✦ LIBER ✦

The least point covering and domination numbers of a graph

✍ Scribed by E. Sampathkumar

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 310 KB
Volume: 86
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90356-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

The product of the independent dominatio

The product of the independent domination numbers of a graph and its complement

✍ E.J. Cockayne; O. Favaron; H. Li; G. MacGillivray 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 240 KB

The sequence of upper and lower dominati

The sequence of upper and lower domination, independence and irredundance numbers of a graph

✍ E.J. Cockayne; C.M. Mynhardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 803 KB

Necessary and sufficient conditions are established for the existence of a graph whose upper and lower domination, independence and irredundance numbers are six given positive integers. This result shows that the only relationships between these six parameters which hold for all graphs and which do

Inequalities between the domination numb

Inequalities between the domination number and the chromatic number of a graph

✍ Dieter Gernert 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds for u + x and ax are proved, where u is the domination number and x the chromatic number of a graph.

Estimations for the domination number of

Estimations for the domination number of a graph

✍ Peter Flach; Lutz Volkmann 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 345 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