arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.05239math.CO
收藏

关于循环图的划分维数

On the Partition Dimension of Circulant Graphs

Cyriac Grigorious, Sudeep Stephen, Bharati Rajan, Mirka Miller, Paul Manuel

摘要:

对于连通图$G(V,E)$的顶点$v$和$V$的子集$S$,$v$和$S$之间的距离定义为$d(v,S)=min\{d(v,x):x \in S \}.$对于$V$的有序\emph{k} -划分$Π=\{S_1,S_2\ldots S_k\}$,$v$相对于$Π$的表示是$k$ -向量$r(v|Π) =(d(v,S_1),d(v,S_2)\ldots d(v,S_k)).$如果$k$-向量$r(v|Π)$,$v \in V$是不同的,则$k$ -划分$Π$是一个分解划分.存在$V$的解析$k$ -分区的最小$k$是$G$的\emph{partition dimension}。Salman等人{ \rm \cite{SaJaCh12} }证明了一类循环图$C(n,\pm \{1,2\})$的\emph{partition dimension}对所有偶数$n\geq6$为4,对所有奇数$n$为3.本文得到了循环图$G=C(n, \pm \{1,2 \ldots j\}), 1\leq j < \lfloor \frac{n}{2}\rfloor$,$n \geq(j+k)(j+1)$,$n \equiv \ k \ mod \ (2j)$的划分维数,并且$k$和$2j$是互素图,\begin{eqnarray*} pd(G) &=& j+1 \ \ \ \ \ \ \ when \ j \ \ is \ even \ and\ all \ k=2m-1, 1 \leq m \leq j \\ pd(G)&=& j+1\ \ \ \ \ \ \ when \ j \ \ is \ odd \ and\ all \ k=2m, 1 \leq m \leq j. \end{eqnarray*}

英文摘要:

For a vertex $v$ of a connected graph $G(V,E)$ and a subset $S$ of $V$, the distance between $v$ and $S$ is defined by $d(v,S)=min\{d(v,x):x \in S \}.$ For an ordered \emph{k}-partition $Π=\{S_1,S_2\ldots S_k\}$ of $V$, the representation of $v$ with respect to $Π$ is the $k$-vector $r(v|Π) =(d(v,S_1),d(v,S_2)\ldots d(v,S_k)).$ The $k$-partition $Π$ is a resolving partition if the $k$-vectors $r(v|Π)$, $v \in V$ are distinct. The minimum $k$ for which there is a resolving $k$-partition of $V$ is the \emph{partition dimension} of $G$. Salman et al.{\rm\cite{SaJaCh12}} claimed that \emph{partition dimension} of a class of circulant graphs $C(n,\pm \{1,2\})$, for all even $n\geq6$ is 4 and it is 3 when $n$ is odd. In this paper we obtain the partition dimension of circulant graphs $G=C(n, \pm \{1,2 \ldots j\}), 1\leq j < \lfloor \frac{n}{2}\rfloor$, $n \geq(j+k)(j+1)$, $n \equiv \ k \ mod \ (2j)$ and $k$ and $2j$ are co-primes as, \begin{eqnarray*} pd(G) &=& j+1 \ \ \ \ \ \ \ when \ j \ \ is \ even \ and\ all \ k=2m-1, 1 \leq m \leq j \\ pd(G)&=& j+1\ \ \ \ \ \ \ when \ j \ \ is \ odd \ and\ all \ k=2m, 1 \leq m \leq j. \end{eqnarray*}

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑