Lower bound on the number of the maximum genus embedding of $K_{n,n}$

Details Lower bound on the number of the maximum genus embedding of $K_{n,n}$ Lower bound on the number of the maximum genus embedding of $K_{n,n}$

2012-03-05

arxiv.org/abs/1203.0855v1

Mathematics

Combinatorics

Scientific paper

In this paper, we provide an method to obtain the lower bound on the number
of the distinct maximum genus embedding of the complete bipartite graph Kn;n (n
be an odd number), which, in some sense, improves the results of S. Stahl and
H. Ren.

Affiliated with

Also associated with

No associations

Rating

Lower bound on the number of the maximum genus embedding of $K_{n,n}$ 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 Lower bound on the number of the maximum genus embedding of $K_{n,n}$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bound on the number of the maximum genus embedding of $K_{n,n}$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132698