In this paper we give an enumeration formula of the outerplanar graphs by means of graph compression, group theory and combinatorial numbers. Some simple examples are exhibited for illustrating the method. The computa...In this paper we give an enumeration formula of the outerplanar graphs by means of graph compression, group theory and combinatorial numbers. Some simple examples are exhibited for illustrating the method. The computational results are shown in the table at the end of this paper.展开更多
Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means ...Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means of the compressing graph and group theory method are given first. Then the relationships between Catalan numbers and the numbers of labeled and unlabeled maximal outerplanar graphs are presented. The computed results verified these formulas.展开更多
文摘In this paper we give an enumeration formula of the outerplanar graphs by means of graph compression, group theory and combinatorial numbers. Some simple examples are exhibited for illustrating the method. The computational results are shown in the table at the end of this paper.
文摘Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means of the compressing graph and group theory method are given first. Then the relationships between Catalan numbers and the numbers of labeled and unlabeled maximal outerplanar graphs are presented. The computed results verified these formulas.
