Enumerating planar locally finite cayley graphs

被引：4

作者：

Renault, D ^{[1
]}

机构：

[1] Univ Bordeaux 1, Lab Bordelais Rech Informat LaBRI, F-33405 Talence, France

来源：

GEOMETRIAE DEDICATA | 2005年 / 112卷 / 01期

关键词：

vertex-transitive; Cayley graph; planar graph; tiling; labeling scheme;

D O I：

10.1007/s10711-005-0548-1

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all planar locally finite Cayley graphs of a given degree. This analysis allows us to solve the problem of decision of the locally finite planarity for a word-problem-decidable presentation.

引用

页码：25 / 49

页数：25