Generating nonisomorphic quadrangular embeddings of a complete graph
VP Korzhik - Journal of Graph Theory, 2013 - Wiley Online Library
Journal of Graph Theory, 2013•Wiley Online Library
… One needs to be aware of the difference between embeddings of graphs as labeled
objects (in this case, we speak about distinct embeddings as they have different face sets)
and as unlabeled objects (and then we speak about nonisomorphic embeddings). In view of
difficulties with finding triangular … In the present article, we show how to construct urn:x-wiley:03649024:media:jgt21697:jgt21697-math-0045
nonisomorphic orientable as well as nonorientable cyclic quadrangular embeddings of urn:x-wiley:03649024:media:jgt21697:jgt21697-math-0046
. We obtain our embeddings by using index one current graphs with current group urn:x-wiley:03649024:media:jgt21697:jgt21697-math-0047 …
objects (in this case, we speak about distinct embeddings as they have different face sets)
and as unlabeled objects (and then we speak about nonisomorphic embeddings). In view of
difficulties with finding triangular … In the present article, we show how to construct urn:x-wiley:03649024:media:jgt21697:jgt21697-math-0045
nonisomorphic orientable as well as nonorientable cyclic quadrangular embeddings of urn:x-wiley:03649024:media:jgt21697:jgt21697-math-0046
. We obtain our embeddings by using index one current graphs with current group urn:x-wiley:03649024:media:jgt21697:jgt21697-math-0047 …
Abstract
We construct (resp. ) index one current graphs with current group such that the current graphs have different underlying graphs and generate nonisomorphic orientable (resp. nonorientable) quadrangular embeddings of the complete graph , (resp. ).
Wiley Online Library