✦ LIBER ✦

Domination in permutation graphs

✍ Scribed by Martin Farber; J Mark Keil

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 617 KB
Volume: 6
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(85)90001-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge domination on bipartite permutation

Edge domination on bipartite permutation graphs and cotriangulated graphs

✍ Anand Srinivasan; K. Madhukar; P. Nagavamsi; C.Pandu Rangan; Maw-Shang Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Permutation graphs: Connected domination

Permutation graphs: Connected domination and Steiner trees

✍ Charles J. Colbourn; Lorna K. Stewart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

Finding minimum dominating cycles in per

Finding minimum dominating cycles in permutation graphs

✍ Charles J Colbourn; J.Mark Keil; Lorna K Stewart 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Connected domination and Steiner set on

Connected domination and Steiner set on weighted permutation graphs

✍ K. Arvind; C. Pandu Regan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A new approach for the domination proble

A new approach for the domination problem on permutation graphs

✍ Y. Liang; C. Rhee; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 933 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