Computer Science – Discrete Mathematics
Scientific paper
2004-12-17
Computer Science
Discrete Mathematics
Article : 23 pages, 15 figures Appendix : 13 pages, 72 figures Submitted to Discrete Mathematics The appendix is accessible at
Scientific paper
We consider the class of the topologically locally finite (in short TLF) planar vertex-transitive graphs, a class containing in particular all the one-ended planar Cayley graphs and the normal transitive tilings. We characterize these graphs with a finite local representation and a special kind of finite state automaton named labeling scheme. As a result, we are able to enumerate and describe all TLF-planar vertex-transitive graphs of any given degree. Also, we are able decide to whether any TLF-planar transitive graph is Cayley or not.
No associations
LandOfFree
The vertex-transitive TLF-planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The vertex-transitive TLF-planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The vertex-transitive TLF-planar graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159187