首页 | 本学科首页   官方微博 | 高级检索  
     

GROUP THEORY METHODFOR ENUMERATION OFOUTERPLANAR GRAPHS
引用本文:胡冠章. GROUP THEORY METHODFOR ENUMERATION OFOUTERPLANAR GRAPHS[J]. 应用数学学报(英文版), 1998, 14(4): 381-387. DOI: 10.1007/BF02683822
作者姓名:胡冠章
作者单位:Department of Applied Mathematics,Tsinghua University,Beijing 100084,China
摘    要:1.IntroductionAplanargraphiscalledanouterplanargraph[']ifinitsplaneembeddingitsvenicescanbeplacedontheboundaryofaface.Thisfaceisusuallycalledanouterface.Anouterplanargraphissaidtobemaximumifwecannotaddanyedgetokeepitsouterplanarity.Wesupposethatallouterplanargraphsinvestigatedinthispaperaretwoconnected.Theedgesontheboundaryoftheouterfacearecalledouteredgesandotheredgesarecalledinneredgesorchords.Apathu--vconsistedofouteredgeswithd(u)23andd(v)23iscalledasinglechain.Asinglechainissaidtobetrivi…

收稿时间:1995-03-31

Group theory method for enumeration of outerplanar graphs
Hu Guanzhang. Group theory method for enumeration of outerplanar graphs[J]. Acta Mathematicae Applicatae Sinica, 1998, 14(4): 381-387. DOI: 10.1007/BF02683822
Authors:Hu Guanzhang
Affiliation:(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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号