Dominating Cliques in Distance-Hereditary Graphs

A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating clique and maximum strict r-packing set problems on distance-hereditary graphs. Some related problems such as diameter, radius, central vertex, r-dominating by cliques and r-dominant clique are investigated too.

• Type: Conference
• Year: 1994
• Where: SWAT
• Authors: Feodor F. Dragan
• Keywords: Algorithms, Linear Time Algorithms, Maximum Strict R-packing, Minimum R-dominating Clique, SWAT 1994