✦ LIBER ✦

Efficient domination of the orientations of a graph

✍ Scribed by David W. Bange; Anthony E. Barkauskas; Linda H. Host; Lane H. Clark

Book ID: 104114032
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 569 KB
Volume: 178
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)81813-4

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 cototal domination number of a graph

✍ Kulli, V. R.; Janakiram, B.; Iyer, Radha R. 📂 Article 📅 1999 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 271 KB

Generating the Acyclic Orientations of a

Generating the Acyclic Orientations of a Graph

✍ Matthew B Squire 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 206 KB

The acyclic orientations of a graph are related to its chromatic polynomial, to its reliability, and to certain hyperplane arrangements. In this paper, an algorithm for listing the acyclic orientations of a graph is presented. The algorithm is shown to Ž . require O n time per acyclic orientation ge

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

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