Skip to main content
SpringerLink
Log in

Junction trees of general graphs

  • Research Article
  • Published:
Frontiers of Mathematics in China Aims and scope Submit manuscript

Abstract

In this paper, we study the maximal prime subgraphs and their corresponding structure for any undirected graph. We introduce the notion of junction trees and investigate their structural characteristics, including junction properties, induced-subtree properties, running-intersection properties and maximum-weight spanning tree properties. Furthermore, the characters of leaves and edges on junction trees are discussed.

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. Berry A, Bordat J P. Separability generalizes Dirac’s theorem. Discrete Applied Mathematics, 1998, 84: 43–53

    Article  MATH  MathSciNet  Google Scholar 

  2. Blair J R S, Peyton B W. An introduction to chordal graphs and clique trees. In: George J A, Liu J W H, Eds. Sparse Matrix Computations: Graph Theory Issues and Algorithms, IMA Volumes in Mathematics and Its Applications, Vol 56. Berlin: Springer-Verlag, 1993, 1–30

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Darroch J N, Lauritzen S L, Speed T P. Markov fields and log-linear interaction models for contingency tables. Ann Statist, 1980, 8: 522–539

    Article  MATH  MathSciNet  Google Scholar 

  5. Diestel R. Graph Decomposition-A Study in Infinite Graph Theory. Oxford: Clarendon Press, 1990

    Google Scholar 

  6. Dirac G A. On rigid circuit graphs. Abh Math Sem Univ Hamburg, 1961, 25: 71–76

    Article  MATH  MathSciNet  Google Scholar 

  7. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J Combin Theory, Ser B, 1974, 16: 47–56

    Article  MATH  MathSciNet  Google Scholar 

  8. Leimer H G. Optimal decomposition by clique separators. Discrete Math, 1993, 113: 99–123

    Article  MATH  MathSciNet  Google Scholar 

  9. Lekkerkerker C G, Boland J C. Representation of a finite graph by a set of intervals on the real line. Fund Math Polska Akad Nauk, 1962, 51: 45–64

    MATH  MathSciNet  Google Scholar 

  10. Tarjan R E. Decomposition by clique separators. Discrete Math, 1985, 55: 221–232

    Article  MATH  MathSciNet  Google Scholar 

  11. Walter J. Representations of rigid cycle graphs. Dissertation for the Doctoral Degree. Detroit: Wayne State University, 1972

  12. Xu P F, Guo J H. Optimal triangulation of Bayesian networks by decomposition. Technical Report KLAS#07-003. Changchun: Northeast Normal University, 2007

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Northeast Normal University, Changchun, 130024, China

    Xiaofei Wang & Jianhua Guo

Authors
  1. Xiaofei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianhua Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianhua Guo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, X., Guo, J. Junction trees of general graphs. Front. Math. China 3, 399–413 (2008). https://doi.org/10.1007/s11464-008-0023-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11464-008-0023-z

Keywords

MSC

Search

Navigation