科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is proved that a complete graph K m can have an orientation whose minimum directed genus is inverted right perpendicular1/12 (n - 3)(n - 4)inverted left perpendicular if and only if n (math) 3, 7 (mod 12). This answers a question of Bonnington et al. by using a method different from current graphs. It is also proved that a complete symmetric tripartite graph K-n,K-n,K-n has an orientation whose minimum directed genus is 1/2 (n - 1)(n - 2).
- 出版日期2018
- 单位北京交通大学
