VERTEXSET CONTAINED IN LONGEST DOMINATING CYCLES IN GRAPHS
VU DINH HOA
Abstract
Let be an undirected and simple graph. A cycle in is called a {\it dominating cycle} if is an independent set of vertices in . is called {\it dominable} if contains a dominating cycle , and we say is {\it dominated} by . In this paper we establish sets of vertices which are contained in any longest dominating cycle in .