Characterization of Randomly k-Dimensional Graphs

Details Characterization of Randomly k-Dimensional Graphs Characterization of Randomly k-Dimensional Graphs

2011-03-18

arxiv.org/abs/1103.3570v1

Mathematics

Combinatorics

12 pages, 3 figures

Scientific paper

For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),.,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. A minimum resolving set for $G$ is a basis of $G$ and its cardinality is the metric dimension of $G$. The resolving number of a connected graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a resolving set. A connected graph $G$ is called randomly $k$-dimensional if each $k$-set of vertices of $G$ is a basis. In this paper, along with some properties of randomly $k$-dimensional graphs, we prove that a connected graph $G$ with at least two vertices is randomly $k$-dimensional if and only if $G$ is complete graph $K_{k+1}$ or an odd cycle.

Affiliated with

Also associated with

No associations

Rating

Characterization of Randomly k-Dimensional Graphs 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 Characterization of Randomly k-Dimensional Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization of Randomly k-Dimensional Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184530