Finding minimum dominating cycles in permutation graphs

Charles J. Colbourn; J. Mark Keil; Lorna K. Stewart

doi:10.1016/0167-6377(85)90044-6

Finding minimum dominating cycles in permutation graphs

Charles J. Colbourn, J. Mark Keil, Lorna K. Stewart

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

A dominating cycle for a graph G = (V, E) is a subset C of V which has the following properties: (i) the subgraph of G induced by C has a Hamiltonian cycle, and (ii) every vertex of V is adjacent to some vertex of C. In this paper, we develop an O(n²) algorithm for finding a minimum cardinality dominating cycle in a permutation graph. We also show that a minimum cardinality dominating cycle in a permutation graph always has an even number of vertices unless it is isomorphic to C₃.

Original language	English (US)
Pages (from-to)	13-17
Number of pages	5
Journal	Operations Research Letters
Volume	4
Issue number	1
DOIs	https://doi.org/10.1016/0167-6377(85)90044-6
State	Published - May 1985
Externally published	Yes

Keywords

dominating cycle
dominating set
permutation graph
polynomial algorithm

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/0167-6377(85)90044-6

Fingerprint Dive into the research topics of 'Finding minimum dominating cycles in permutation graphs'. Together they form a unique fingerprint.

Cite this

@article{3ee4584f10af497f8f5a3fe1fffd7c2c,

title = "Finding minimum dominating cycles in permutation graphs",

abstract = "A dominating cycle for a graph G = (V, E) is a subset C of V which has the following properties: (i) the subgraph of G induced by C has a Hamiltonian cycle, and (ii) every vertex of V is adjacent to some vertex of C. In this paper, we develop an O(n2) algorithm for finding a minimum cardinality dominating cycle in a permutation graph. We also show that a minimum cardinality dominating cycle in a permutation graph always has an even number of vertices unless it is isomorphic to C3.",

keywords = "dominating cycle, dominating set, permutation graph, polynomial algorithm",

author = "Colbourn, {Charles J.} and Keil, {J. Mark} and Stewart, {Lorna K.}",

note = "Funding Information: * Research supported by the Natural Sciences and Engineering Research Council of Canada Grant no. A0579.",

year = "1985",

month = may,

doi = "10.1016/0167-6377(85)90044-6",

language = "English (US)",

volume = "4",

pages = "13--17",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Finding minimum dominating cycles in permutation graphs

AU - Colbourn, Charles J.

AU - Keil, J. Mark

AU - Stewart, Lorna K.

N1 - Funding Information: * Research supported by the Natural Sciences and Engineering Research Council of Canada Grant no. A0579.

PY - 1985/5

Y1 - 1985/5

N2 - A dominating cycle for a graph G = (V, E) is a subset C of V which has the following properties: (i) the subgraph of G induced by C has a Hamiltonian cycle, and (ii) every vertex of V is adjacent to some vertex of C. In this paper, we develop an O(n2) algorithm for finding a minimum cardinality dominating cycle in a permutation graph. We also show that a minimum cardinality dominating cycle in a permutation graph always has an even number of vertices unless it is isomorphic to C3.

AB - A dominating cycle for a graph G = (V, E) is a subset C of V which has the following properties: (i) the subgraph of G induced by C has a Hamiltonian cycle, and (ii) every vertex of V is adjacent to some vertex of C. In this paper, we develop an O(n2) algorithm for finding a minimum cardinality dominating cycle in a permutation graph. We also show that a minimum cardinality dominating cycle in a permutation graph always has an even number of vertices unless it is isomorphic to C3.

KW - dominating cycle

KW - dominating set

KW - permutation graph

KW - polynomial algorithm

UR - http://www.scopus.com/inward/record.url?scp=0022064525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022064525&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(85)90044-6

DO - 10.1016/0167-6377(85)90044-6

M3 - Article

AN - SCOPUS:0022064525

VL - 4

SP - 13

EP - 17

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 1

ER -

Finding minimum dominating cycles in permutation graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this