|
|||||
|
|
Dispersed points and geometric embedding of complete bipartite graphs |
|
| Authors: | Hiroshi Maehara |
| Affiliation: | (1) College of Education, Ryukyu University, Okinawa, Japan |
| Abstract: | The minimum dimension needed to representK(m, n) as a “unit neighborhood graph” in Euclidean space is considered. Some upper and lower bounds on this dimension are given, and the exact values of the dimension are calculated form≤3,n≤10. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |