Regular embeddings of complete bipartite graphs: classification and enumeration

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-172964

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.