Chain graph (CG) is a general model of graphical Markov models. Some different chain graphs may describe the same conditional independence structure, then we say that these CGs are Markov equivalent. In 1990 Frydenber...Chain graph (CG) is a general model of graphical Markov models. Some different chain graphs may describe the same conditional independence structure, then we say that these CGs are Markov equivalent. In 1990 Frydenberg showed that every class of Markov equivalent CGs has a CG which is called the largest chain graph with the greatest number of lines. This paper presents an efficient algorithm for finding the largest chain graph of the corresponding Markov equivalent class of a given CG. The computational complexity of the algorithm is O(n3). It is more efficient than the complexity O(n!) of the present algorithms. Also a more intuitive graphical characterization of the largest chain graph is provided based on the algorithm in this paper.展开更多
In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic inde...In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic index of unilateral polyomino chain and unilateral hexagonal chain. Also, the third geometric-arithmetic index of these chemical structures are presented.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos..39930160&19871003).
文摘Chain graph (CG) is a general model of graphical Markov models. Some different chain graphs may describe the same conditional independence structure, then we say that these CGs are Markov equivalent. In 1990 Frydenberg showed that every class of Markov equivalent CGs has a CG which is called the largest chain graph with the greatest number of lines. This paper presents an efficient algorithm for finding the largest chain graph of the corresponding Markov equivalent class of a given CG. The computational complexity of the algorithm is O(n3). It is more efficient than the complexity O(n!) of the present algorithms. Also a more intuitive graphical characterization of the largest chain graph is provided based on the algorithm in this paper.
文摘In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic index of unilateral polyomino chain and unilateral hexagonal chain. Also, the third geometric-arithmetic index of these chemical structures are presented.
