Premium
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
Author(s) -
Korzhik Vladimir P.
Publication year - 2009
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20430
Subject(s) - combinatorics , mathematics , current (fluid) , path (computing) , graph , order (exchange) , discrete mathematics , computer science , physics , finance , economics , thermodynamics , programming language
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