Name
Abstract | ||
|---|---|---|
Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P boolean AND C. In this paper we define the generalized island Johnson graph of P as the graph whose vertex consists of all islands of P of cardinality k, two of which are adjacent if their intersection consists of exactly l elements. We show that for large enough values of n, this graph is connected, and give upper and lower bounds on its diameter. |
Year | Venue | Keywords |
|---|---|---|
2013 | DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | Johnson graph,intersection graph,diameter,connectedness,islands |
DocType | Volume | Issue |
Journal | 15.0 | 3.0 |
ISSN | Citations | PageRank |
1462-7264 | 3 | 0.56 |
References | Authors | |
5 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Crevel Bautista-Santiago | 1 | 5 | 1.31 |
| Javier Cano | 2 | 65 | 12.20 |
| Ruy Fabila Monroy | 3 | 48 | 16.57 |
| David Flores-Peñaloza | 4 | 32 | 6.44 |
| HernáN GonzáLez-Aguilar | 5 | 19 | 4.23 |
| Dolores Lara | 6 | 7 | 2.50 |
| Eliseo Sarmiento | 7 | 16 | 3.00 |
| Jorge Urrutia | 8 | 1064 | 134.74 |