On the Connectedness and Diameter of a Geometric Johnson Graph

Details On the Connectedness and Diameter of a Geometric Johnson Graph On the Connectedness and Diameter of a Geometric Johnson Graph

2012-02-15

arxiv.org/abs/1202.3455v1

Mathematics

Combinatorics

Scientific paper

Let $P$ be a set of $n$ points in general position in the plane. A subset $I$ of $P$ is called an \emph{island} if there exists a convex set $C$ such that $I = P \cap C$. In this paper we define the \emph{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.

Affiliated with

Also associated with

No associations

Rating

On the Connectedness and Diameter of a Geometric Johnson Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Connectedness and Diameter of a Geometric Johnson Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Connectedness and Diameter of a Geometric Johnson Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124658