论文信息 - Junction trees of general graphs

Junction trees of general graphs

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.

Jianhua Guo | Xiaofei Wang

[1] Robert E. Tarjan,et al. Decomposition by clique separators , 1985, Discret. Math..

[2] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..

[3] T. Speed,et al. Markov Fields and Log-Linear Interaction Models for Contingency Tables , 1980 .

[4] Hanns-Georg Leimer,et al. Optimal decomposition by clique separators , 1993, Discret. Math..

[5] Anne Berry,et al. Separability Generalizes Dirac's Theorem , 1998, Discret. Appl. Math..

[6] G. Dirac. On rigid circuit graphs , 1961 .

[7] R. Diestel. Graph Decompositions: A Study in Infinite Graph Theory , 1990 .

[8] B. Peyton,et al. An Introduction to Chordal Graphs and Clique Trees , 1993 .

[9] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[10] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .