Advertisement

Dominating cliques in distance-hereditary graphs

  • Feodor F. Dragan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)

Abstract

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.

Keywords

Steiner Tree Chordal Graph Linear Time Algorithm Central Vertex Clique Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H.-J.Bandelt A.Henkmann, and F.Nicolai Powers of distance-hereditary graphs, Technical Report SM-DU-220, University Duisburg 1993.Google Scholar
  2. [2]
    H.-J. Bandelt and H.M. Mulder, Distance-hereditary graphs, J. Comb. Theory Ser.B, 41 (1986) 182–208.Google Scholar
  3. [3]
    H.-J. Bandelt and H.M. Mulder, Pseudo-modular graphs, Discrete Math., 62 (1986) 245–260.Google Scholar
  4. [4]
    A.Brandstädt, Special graph classes — a survey, Technical Report SM-DU-199, University Duisburg 1993.Google Scholar
  5. [5]
    A.Brandstädt, F.F. Dragan, V.D. Chepoi, and V.I. Voloshin, Dually chordal graphs, Technical Report SM-DU-225, University of Duisburg 1993, to appear as extended abstract in the proceedings of WG'93, (ed. J. van Leeuwen), Utrecht, The Netherlands, submitted to SIAM J. Discr. Math.Google Scholar
  6. [6]
    A.Brandstädt and D.Kratsch, Domination problems on permutation and other graphs, Theoretical Computer Science, 54 (1987) 181–198.Google Scholar
  7. [7]
    G.J.Chang, Centers of chordal graphs, Graphs and Combinatorics, 7 (1991) 305–313.Google Scholar
  8. [8]
    A. D'Atri and M. Moscarini, Distance-hereditary graphs, Steiner trees and connected domination, SIAM J. Computing, 17 (1988) 521–538.CrossRefGoogle Scholar
  9. [9]
    F.F.Dragan and A.Brandstädt, r-Dominating cliques in Helly graphs and chordal graphs, Technical Report SM-DU-228, University Duisburg 1993, Proc. of the 11th STACS, Caen, France, Springer, LNCS 775, 735–746, 1994Google Scholar
  10. [10]
    M.C.Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.Google Scholar
  11. [11]
    P.L. Hammer and F.Maffray, Completely separable graphs, Discrete Appl. Math., 27 (1990) 85–99.Google Scholar
  12. [12]
    S.C.Hedetniemi and R.Laskar, (eds.), Topics on Domination, Annals of Discr. Math. 48, North-Holland, 1991.Google Scholar
  13. [13]
    E.Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2, 28 (1977) 417–420.Google Scholar
  14. [14]
    D.Kratsch, Finding dominating cliques efficiently in strongly chordal graphs and undirected path graphs, Annals of Discr. Math. 48, Topics on Domination, (S.C.Hedetniemi, R.Laskar, eds.), 225–238.Google Scholar
  15. [15]
    D.Kratsch, P.Damaschke and A.Lubiw, Dominating cliques in chordal graphs, to appear in Discrete Mathematics.Google Scholar
  16. [16]
    S.V.Yushmanov and V.D.Chepoi, A general method of investigation of characteristic of graphs related with eccentricity Math. Problems of Cybernetics, Moscow 3 1991 217–232 (Russian, English transl.)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Feodor F. Dragan
    • 1
  1. 1.Dept. of Math. and Cybern.Moldova State UniversityChişinauMoldova

Personalised recommendations