✦ LIBER ✦

A linear algorithm for the domination number of a series-parallel graph

✍ Scribed by Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 660 KB
Volume: 5
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90003-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm to solve the wei

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 379 KB

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

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

The difference between the domination nu

The difference between the domination number and the minus domination number of a cubic graph

✍ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph

A linear vizing-like relation between th

A linear vizing-like relation between the size and the domination number of a graph

✍ Rautenbach, Dieter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We prove m ≤ ∆n -(∆ + 1)γ for every graph without isolated vertices of order n, size m, domination number γ and maximum degree ∆ ≥ 3. This generalizes a result of Fisher et al., CU-Denver Tech Rep, 1996] who obtained the given bound for the case ∆ = 3.