DocumentCode
578416
Title
An algorithm for planarity testing by adjacency matrix
Author
Li, Shi-qun ; Ma, Qian-li
Author_Institution
Sch. of Math. & Comput. Sci., Hunan Univ. of Sci. & Technol., Xiangtan, China
Volume
4
fYear
2012
fDate
15-17 July 2012
Firstpage
1412
Lastpage
1417
Abstract
It is of great use to determine whether a graph is planar in both information technology and engineering areas. Although there are some known algorithms, they are quite difficult to understand and to implement. This paper proposes a new method to determine the planarity of a graph by adjacency matrix, which is very easy to implement. Especially, we give the degree conditions for the planarity of 6-vertex undirected simple graphs.
Keywords
engineering; graph theory; information technology; matrix algebra; 6-vertex undirected simple graphs; adjacency matrix; engineering; information technology; planarity testing; Adjacency matrix; Edge contraction; Planar graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics (ICMLC), 2012 International Conference on
Conference_Location
Xian
ISSN
2160-133X
Print_ISBN
978-1-4673-1484-8
Type
conf
DOI
10.1109/ICMLC.2012.6359572
Filename
6359572
Link To Document