Skip to main content
Springer Nature Link
Log in

Dually chordal graphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 790))

Included in the following conference series:

  • 183 Accesses

Abstract

Recently in several papers ([10],[22],[42]) independently graphs with maximum neighbourhood orderings were characterized and turned out to be algorithmically useful.

This paper gives a unified framework for characterizations of those graphs in terms of neighbourhood and clique hypergraphs which have the Helly property and whose line graph is chordal. These graphs are dual (in the sense of hypergraphs) to chordal graphs.

By using the hypergraph approach in a systematical way new results are obtained, some of the old results are generalized and some of the proofs are simplified.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R.P. Anstee and M. Farber, Characterizations of totally balanced matrices, J. Algorithms, 5(1984), 215–230

    Google Scholar 

  2. G. Ausiello, A. D'Atri, and M. Moscarini, Chordality properties on graphs and minimal conceptual connections in semantic data models, Journal of Computer and System Sciences vol. 33, (1986),179–202

    Google Scholar 

  3. H.-J. Bandelt, Neighbourhood-Helly Powers, manuscript 1992, University of Hamburg

    Google Scholar 

  4. H.-J. Bandelt, Hereditary modular graphs, Combinatorica 8 (2) (1988), 149–157

    Google Scholar 

  5. H.-J. Bandelt, A. Dählmann, and H. Schütte, Absolute retracts of bipartite graphs, Discrete Applied Mathematics 16 (1987), 191–215

    Google Scholar 

  6. H.-J. Bandelt, M. Farber, and P. Hell, Absolute reflexive retracts and absolute bipartite retracts, Discrete Mathematics, to appear

    Google Scholar 

  7. H.-J. Bandelt, and H. M. Mulder, Pseudo-modular graphs, Discrete Mathematics, 62 (1986), 245–260

    Google Scholar 

  8. H.-J. Bandelt, and E. Prisner, Clique graphs and Helly graphs, Journal of Combinatorial Theory B, 51,1 (1991),34–45

    Google Scholar 

  9. C. Berri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes, Journal of the ACM, 30,3 (1983), 479–513

    Google Scholar 

  10. H. Behrendt and A. Brandstädt, Domination and the use of maximum neighbourhoods, technical report SM-DU-204, University of Duisburg 1992

    Google Scholar 

  11. C. Berge, Hypergraphs, North Holland, 1989

    Google Scholar 

  12. A. Brandstädt, Classes of bipartite graphs related to chordal graphs, Discrete Applied Mathematics, 32 (1991), 51–60

    Google Scholar 

  13. A. E. Brouwer, P. Duchet, and A. Schrijver, Graphs whose neighbourhoods have no special cycles, Discrete Mathematics 47 (1983), 177–182

    Google Scholar 

  14. P. Buneman, A characterization of rigid circuit graphs, Discr. Math., 9 (1974), 205–212

    Google Scholar 

  15. R. Chandrasekaran and A. Tamir, Polynomially bounded algorihtms for locating p-centers on a tree, Math. Programming, 22 (1982), 304–315

    Google Scholar 

  16. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic and Discrete Methods, 5(1984), 332–345

    Google Scholar 

  17. A. D'Atri and M. Moscarini, On hypergraph acyclicity and and graph chordality, Inf. Proc. Letters, 29,5 (1988), 271–274

    Google Scholar 

  18. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25(1961), 71–76

    Google Scholar 

  19. F. F. Dragan, Centers of graphs and the Helly property, (in Russian) Ph.D. Thesis, Moldova State University 1989

    Google Scholar 

  20. F.F. Dragan, Conditions for coincidence of local and global minimums for the eccentricity function on graphs and the Helly property, (in Russian), Res. in Appl. Math. and Inform. (Kishinev), 1990, 49–56

    Google Scholar 

  21. F.F. Dragan, HT-graphs: centers, connected r-domination and Steiner trees, manuscript 1992

    Google Scholar 

  22. F. F. Dragan, C. F. Prisacaru, and V. D. Chepoi, Location problems in graphs and the Helly property (in Russian), Discrete Mathematics, Moscow, 4(1992), 67–73 (the full version appeared as preprint: F.F. Dragan, C.F. Prisacaru, and V.D. Chepoi, r-Domination and p-center problems on graphs: special solution methods and graphs for which this method is usable (in Russian), Kishinev State University, preprint Mold-NIINTI, N. 948-M88, 1987)

    Google Scholar 

  23. F. F. Dragan and V. I. Voloshin, Hypertrees and associated graphs, manuscript Moldova State University 1992

    Google Scholar 

  24. P. Duchet, Propriete de Helly et problemes de representation, Colloqu. Intern. CNRS 260, Problemes Combin. et Theorie du Graphes, Orsay, France 1976, 117–118

    Google Scholar 

  25. P. Duchet, Classical perfect graphs: an introduction with emphasis on triangulated and interval graphs, Ann. Discr. Math., 21(1984), 67–96

    Google Scholar 

  26. R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, J. ACM, 30 (1983), 514–550

    Google Scholar 

  27. M. Farber, Characterizations of strongly chordal graphs, Discr. Math., 43 (1983), 173–189

    Google Scholar 

  28. C. Flament, Hypergraphes arbores, Discrete Mathematics, 21 (1978), 223–227

    Google Scholar 

  29. D.R. Fulkerson and O.R. Gross, Incidence matrices and interval graphs, Pacif. J. Math. 15 (1965), 835–855

    Google Scholar 

  30. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980

    Google Scholar 

  31. M.C. Golumbic, Algorithmic aspects of intersection graphs and representation hypergraphs, Graphs and Combinatorics, 4 (1988), 307–321

    Google Scholar 

  32. M.C. Golumbic and C.F. Goss, Perfect elimination and chordal bipartite graphs, J. Graph theory, 2(1978), 155–163

    Google Scholar 

  33. N. Goodman and O. Shmueli, Syntactic characterization of tree database schemes, Journal of the ACM 30 (1983),767–786

    Google Scholar 

  34. A.J. Hoffman, A.W.J. Kolen, and M. Sakarovitch, Totally balanced and greedy matrices, SIAM J. Alg. Discr. Methods, 6(1985), 721–730

    Google Scholar 

  35. A.W.J. Kolen, Duality in tree location theory, Cah. Cent. Etud. Rech. Oper., 25 (1983), 201–215

    Google Scholar 

  36. J. Lehel, A characterization of totally balanced hypergraphs, Discr. Math., 57 (1985), 59–65

    Google Scholar 

  37. A. Lubiw, Doubly lexical orderings of matrices, SIAM J. Comput. 16 (1987), 854–879

    Google Scholar 

  38. M. Moscarini, Doubly chordal graphs, Steiner trees and connected domination, Networks, 23(1993), 59–69

    Google Scholar 

  39. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput., 16(1987), 973–989

    Google Scholar 

  40. D.J. Rose, R.E. Tarjan, and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5(1976), 266–283

    Google Scholar 

  41. J.P. Spinrad, Doubly lexical ordering of dense 0-1-matrices, manuscipt 1988, to appear in SIAM J. Comput.

    Google Scholar 

  42. J.L. Szwarcfiter and C.F. Bornstein, Clique graphs of chordal and path graphs, manuscript 1992

    Google Scholar 

  43. R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13,3 (1984), 566–579

    Google Scholar 

  44. V.I. Voloshin, Properties of triangulated graphs (in Russian), Issledovaniye operaziy i programmirovanie (Kishinev), 1982, 24–32

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FG Inf., Universität -GH- Duisburg FB Math, D 47048, Duisburg, Germany

    Andreas Brandstädt

  2. Dept. of Math. and Cybern, Moldavian State University Chisinau A, Mateevici str. 60, 277009, Kishinev, Moldova

    Feodor F. Dragan, Victor D. Chepoi & Vitaly I. Voloshin

Authors
  1. Andreas Brandstädt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feodor F. Dragan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor D. Chepoi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vitaly I. Voloshin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandstädt, A., Dragan, F.F., Chepoi, V.D., Voloshin, V.I. (1994). Dually chordal graphs. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-57899-4_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57899-4

  • Online ISBN: 978-3-540-48385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics