PLANAR CAYLEY GRAPHS WITH REGULAR DUAL (Q4335878)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1006580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PLANAR CAYLEY GRAPHS WITH REGULAR DUAL |
scientific article; zbMATH DE number 1006580 |
Statements
PLANAR CAYLEY GRAPHS WITH REGULAR DUAL (English)
0 references
20 July 1997
0 references
planar biregular graph
0 references
cylindrical graph
0 references
network
0 references
Cayley graph
0 references
planar graph
0 references
tiling
0 references
0.7960107326507568
0 references
0.7909863591194153
0 references
0.7894388437271118
0 references
0.7818771004676819
0 references
Graphs which can be seen as representing a group have a compact and convenient representation for use in computer science. In the case of a network of automata, one needs a finite local description of the neighborhood of each cell, and the global structure must be regular: if the network is the Cayley graph, these properties are guaranteed. A planar graph which is the Cayley graph of a group must be regular. In this paper, we study regular planar graphs whose dual is also regular. It is interesting to see that they are not all Cayley graphs. Cayley graphs have also been recently used in computer science in the context of tiling problems.
0 references
