Article ID Journal Published Year Pages File Type
5777038 Discrete Mathematics 2017 8 Pages PDF
Abstract
For even n we prove that the genus of the complete tripartite graph Kn,n,1 is ⌈(n−1)(n−2)∕4⌉. This is the least number of bridges needed to build a complete n-way road interchange where changing lanes is not allowed. Both the theoretical result, and the surprising link to modelling road intersections are new.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the genus of the complete tripartite graph Kn,n,1
Authors
,