Regular embeddings of complete bipartite graphs: classification and enumeration

Details Regular embeddings of complete bipartite graphs: classification and enumeration Regular embeddings of complete bipartite graphs: classification and enumeration

2009-11-23

arxiv.org/abs/0911.4340v1

Mathematics

Combinatorics

32 pages

Scientific paper

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where $n$ is a prime power, obtained in collaboration with Du, Kwak, Nedela and \v{S}koviera, together with results of It\^o, Hall, Huppert and Wielandt on factorisable groups and on finite solvable groups.

Affiliated with

Also associated with

No associations

Rating

Regular embeddings of complete bipartite graphs: classification and enumeration 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 Regular embeddings of complete bipartite graphs: classification and enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular embeddings of complete bipartite graphs: classification and enumeration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172964