| GROUP THEORY METHODFOR ENUMERATION OFOUTERPLANAR GRAPHS |
| |
| 作者姓名： | 胡冠章 |
| |
| 作者单位： | Department of Applied Mathematics，Tsinghua University，Beijing 100084，China |
| |
| 摘 要： | 1.IntroductionAplanargraphiscalledanouterplanargraph']ifinitsplaneembeddingitsvenicescanbeplacedontheboundaryofaface.Thisfaceisusuallycalledanouterface.Anouterplanargraphissaidtobemaximumifwecannotaddanyedgetokeepitsouterplanarity.Wesupposethatallouterplanargraphsinvestigatedinthispaperaretwoconnected.Theedgesontheboundaryoftheouterfacearecalledouteredgesandotheredgesarecalledinneredgesorchords.Apathu--vconsistedofouteredgeswithd(u)23andd(v)23iscalledasinglechain.Asinglechainissaidtobetrivi…
|
| 收稿时间： | 31 March 1995 |
Group theory method for enumeration of outerplanar graphs |
| |
| Hu Guanzhang.GROUP THEORY METHODFOR ENUMERATION OFOUTERPLANAR GRAPHS[J].Acta Mathematicae Applicatae Sinica,1998,14(4):381-387. |
| |
| Authors: | Hu Guanzhang |
| |
| Institution: | (1) Department of Applied Mathematics, Tsinghua University, 100084 Beijing, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Enumeration outerplanar graphs group theory method compression method |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
