Journal of Guangdong University of Technology ›› 2006, Vol. 23 ›› Issue (1): 134-138.

• Comprehensive Studies • Previous Articles    

A Constructing Method for All the Maximal Outerplanar Graphs

  

  1. (Faculty of Applied Mathematics,Guangdong University of Technology,Guangzhou 510090,China)
  • Online:2006-02-02 Published:2006-02-02

Abstract: Here a method enduing a matrix to each maximal outerplanar graph of order n is proposed to decide whether graphs are isomorphic,and it is proved that the matrix and the maximal outerplanar are one to one.After constructing all the possible maximal outerplanar graphs,the isomorphic ones are deleted and all the maximal outerplanar graphs are got.At the same time,the number of all the maximal outerplanar graphs of order n is obtained.This paper solves the problem how to decide whether graphs are isomorphic and how to compute all the maximal outerplanar graphs.

Key words: graph theory; maximal outerplanar graphs; isomorphic graph; Hamilton cycle;

[1] 周建,林翠琴.  n阶极大外平面图的构造法[J]. 清华大学学报(自然科学版). 2000(11)

[2] 王绍文.  极大平面图结构研究[J]. 光子学报. 1998(02)

[1] 卢开澄 著.图论及其应用[M]. 清华大学出版社, 1981

[1] Hu Guanzhang.Catalan number and enumeration of maximal outerplanar graphs. Tsinghua Science and Technology . 2000
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!