论文信息 - Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph

Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph

We construct (2s)!=22slog2s−O(s) (resp. (2s−2)!=22slog2s−O(s)) index one current graphs with current group Z8s+5 such that the current graphs have different underlying graphs and generate nonisomorphic orientable (resp. nonorientable) quadrangular embeddings of the complete graph K8s+5, s≥1 (resp. s≥2).

Vladimir P. Korzhik

[1] Mike J. Grannell,et al. A lower bound for the number of orientable triangular embeddings of some complete graphs , 2010, J. Comb. Theory, Ser. B.

[2] Mike J. Grannell,et al. A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs , 2008, J. Comb. Theory, Ser. B.

[3] Mike J. Grannell,et al. Exponential Families of Non-Isomorphic Triangulations of Complete Graphs , 2000, J. Comb. Theory, Ser. B.

[4] Richard D. Ringeisen. Determining AII compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings , 1972 .

[5] Mike J. Grannell,et al. Hamiltonian embeddings from triangulations , 2007 .

[6] Vladimir P. Korzhik. Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments , 2009 .

[7] Vladimir P. Korzhik,et al. On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs , 2001, J. Comb. Theory, Ser. B.

[8] Vladimir P. Korzhik,et al. Exponentially many nonisomorphic orientable triangular embeddings of K12s+3 , 2009, Discret. Math..

[9] Vladimir P. Korzhik,et al. Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs , 2004, J. Comb. Theory, Ser. B.

[10] Mike J. Grannell,et al. Recursive constructions for triangulations , 2002 .

[11] Nguyen Huy Xuong,et al. How to determine the maximum genus of a graph , 1979, J. Comb. Theory, Ser. B.