✦ LIBER ✦

Efficient edge domination in regular graphs

✍ Scribed by Domingos M. Cardoso; J. Orestes Cerdeira; Charles Delorme; Pedro C. Silva

Book ID: 108112745
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 536 KB
Volume: 156
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient edge domination problems in gr

Efficient edge domination problems in graphs

✍ Dana L. Grinstead; Peter J. Slater; Naveed A. Sherwani; Nancy D. Holmes 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 558 KB

Independent domination in regular graphs

✍ Julie Haviland 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th

Signed domination in regular graphs

✍ Odile Favaron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 456 KB

In answer to the open questions proposed by Henning and Slater, we give sharp upper bounds on the upper signed domination number of a regular graph and on the signed domination number of a connected cubic graph. Let G = (V, E) be a simple graph. For v E V, we denote by d(u) the degree of v in V, by

Minus domination in regular graphs

✍ Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice A. McRae 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 77 KB

Generalized domination and efficient dom

Generalized domination and efficient domination in graphs

✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Efficient domination in circulant graphs

✍ Reji Kumar, K.; MacGillivray, Gary 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 210 KB