Research on diameter graphs of finite point sets defined by the number of distance
A planar point set X is called a k-distance set if there are exactly k distinct distances defined by every two points in X, and the longest distance is called diameter D. The set of the endpoints of all diameters is denoted by XD . Let m=m(X)=|XD| be the number of elements of XD, and the diameter g...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Hebei University of Science and Technology
2015-04-01
|
| Series: | Journal of Hebei University of Science and Technology |
| Subjects: | |
| Online Access: | http://xuebao.hebust.edu.cn/hbkjdx/ch/reader/create_pdf.aspx?file_no=b201502005&flag=1&journal_ |