The cardinal number of a minimal join graph set

Algebraic Bayesian networks (ABN) are probabilistic-logic graphic models of knowledge systems with uncertainty and gives an advantage to deal with interval probability estimates. ABNwork dramatically depend on its secondary structure, that is usually represented as join graph. There is a special interest to minimal join graph set that contains the most “effective” secondary structures. The goal of the work is to estimate the cardinal number of the set. A new term volumethat characterizes number of vertices that belong to a strong narrowing connection component. Exploitation of this term let us to express clique division factor that is its numerical property, minimal join graph set cardinal number is evaluated in terms of which.