Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
✍ Scribed by Vladimir P. Korzhik
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 248 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
It is known that for all sufficiently large s, there are at least \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$(\frac{5}{3})$\end{document}^2__s__^ nonequivalent graceful labellings of the path on 2__s__ + 1 vertices. Using this result, we construct exponentially many index one current graphs with current group ℤ~12__s__ + 7~ such that many of the current graphs have different underlying graphs. The constructed current graphs for all sufficiently large s__generate at least 30^s^ nonisomorphic triangular embeddings of K~12__s + 7~. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 324–334, 2009