Skip to main content
SpringerLink
Log in

Some characterizations of doubly chordal graphs

  • Published:
Korean Journal of Computational & Applied Mathematics Aims and scope Submit manuscript

Abstract

Many optimization problems like domination and Steiner tree are NP-complete onchordal graphs but can be solved in polynomial time ondoubly chordal graphs. Investigating properties of doubly chordal graphs probably help to design efficient algorithms for the graphs. We present some characterizations of doubly chordal graphs, which are based on clique matrices and neighborhood matrices. It is also mentioned how adoubly perfect elimination ordering of a doubly chordal graph can be computed from the results.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Ausiello, A. D’Atri, and M. Moscarini,Chordality properties on graphs and minimal conceptual connections in semantic data models, J. Comput. Systems Sci., 33:179–202, 1986.

    Article  MathSciNet  Google Scholar 

  2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis,On the desirability of acyclic database schemes, J. ACM, 30:479–513, 1983.

    Article  MathSciNet  Google Scholar 

  3. P. Buneman,A characterization of rigid circuit graphs, Disc. Math., 9:205–212, 1974.

    Article  Google Scholar 

  4. R. Chandrasekaran and A. Tamir,Polynomially bounded algorithms for locating p-centers on a tree, Math. Programming, 22:304–315, 1982.

    Article  MathSciNet  Google Scholar 

  5. A. D’Atri and M. Moscarini,On hypergraph acyclicity and graph chordality, Information Processing Letters, 29:271–274, 1988.

    Article  MathSciNet  Google Scholar 

  6. R. Fagin,Degrees of acyclicity for hypergraphs and relational database schemes, J. Assoc. Comput. Mach., 30:514–550, 1983.

    Article  MathSciNet  Google Scholar 

  7. M.C. Golumbic,Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.

    Google Scholar 

  8. N. Goodman and O. Shmueli,Syntactic characterization of tree database schemes, J. ACM, 30:767–786, 1983.

    Article  Google Scholar 

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

    Google Scholar 

  10. S.L. Lauritzen and D.J. Spiegelhalter,Local computations with probabilities on graphical structures and their application to expert systems, J. Royal Statist. Soc., Ser. B, 50:157–224, 1988.

    MathSciNet  Google Scholar 

  11. Mahnhoon Lee,Algorithms and characterizations of special graphs in the chordal hierarchy, Technical report, Ph.D. Thesis, School of Computer Science, Univ. of Oklahoma, 1996.

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

    Article  MathSciNet  Google Scholar 

  13. M. Moscarini,Doubly chordal graphs, steiner trees, and connected domination, Networks, 23:59–69, 1993.

    Article  MathSciNet  Google Scholar 

  14. R. Paige and R.E. Tarjan,Three partition refinement algorithms, SIAM J. Cornput., 16(6):973–989, December 1987.

    Article  MathSciNet  Google Scholar 

  15. C.H. Papadimitriou and M. Yannakakis,Scheduling interval ordered tasks, SIAM J. Comput., 8:405–409, 1979.

    Article  MathSciNet  Google Scholar 

  16. D.J. Rose,Triangulated graphs and the elimination process, J. Math. Anal. and App., 32:597–609, 1970.

    Article  MathSciNet  Google Scholar 

  17. D.J. Rose, R.E. Tarjan, and G.S. Lucker,Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5:266–283, 1976.

    Article  MathSciNet  Google Scholar 

  18. J.P. Spinrad,Doubly lexical ordering of dense 0–1 matrices, IPL, 45:229–235, 1993.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Kangnung National University, Kangnung, 210-702, Kangwon, Korea

    Mahnhoon Lee & Changhwa Kim

Authors
  1. Mahnhoon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changhwa Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mahnhoon Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, M., Kim, C. Some characterizations of doubly chordal graphs. Korean J. Comput. & Appl. Math. 5, 65–71 (1998). https://doi.org/10.1007/BF03008936

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03008936

AMS Mathematics Subject Classification

Key word and phrases

Search

Navigation