首页 | 本学科首页   官方微博 | 高级检索  
     


Nonorientable genus of nearly complete bipartite graphs
Authors:Bojan Mohar
Affiliation:1. Department of Mathematics, University E. K. of Ljubljana, Jadranska 19, 61111, Ljubljana, Yugoslavia
Abstract:LetG(m, n, k), m, n≥3,k≤min(m, n), be the graph obtained from the complete bipartite graphK m,n by deleting an arbitrary set ofk independent edges, and let $$f(m,n,k) = [(m - 2)(n - 2) - k]/2.$$ It is shown that the nonorientable genus (tilde gamma ) (G(m, n, k)) of the graphG(m, n, k) is equal to the upper integer part off(m, n, k), except in trivial cases wheref(m, n, k)≤0 and possibly in some extreme cases, the graphsG(k, k, k) andG(k + 1,k, k). These cases are also discussed, obtaining some positive and some negative results. In particular, it is shown thatG(5, 4, 4) andG(5, 5, 5) have no nonorientable quadrilateral embedding.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号