Abstract:
A new terminological approach to join graph processing formalization based on a term of rib cage that is an edge set is suggested. A new system of the join graphs theory accu-rate terms such as weight, narrowing, sinew, backbone connectivity, minimal join graph is suggested. Also the term of join graph and Minimal Join Graph Set Theorem formulating are defined more preciously. A lemma of independent backbone path stating that there are two such edge sets from given collection of non-overlapping edge sets, that a backbone path be-tween them is non-overlapping with any another edge set is formulated and proven.