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.展开更多
We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding ...We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding the codings,i.e., recognizing the corresponding graphs, is given. The codings are shown tobe optimal. The results above possibly give us the clue for studying imagecompression and pattern recognition.展开更多
文摘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.
文摘We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding the codings,i.e., recognizing the corresponding graphs, is given. The codings are shown tobe optimal. The results above possibly give us the clue for studying imagecompression and pattern recognition.
