中文

循环图的不规则标号

组合数学 2011-11-03 v1

摘要

我们研究了循环图 Cin(1,2,...,k)Ci_n(1,2,...,k) 的\textit{不规则强度} (s(G)s(G)) 和\textit{全顶点不规则强度} (tvs(G)tvs(G)),并证明了 tvs(Cin(1,2,...,k))=n+2k2k+1tvs(Ci_n(1,2,...,k))=\lceil\frac{n+2k}{2k+1}\rceil,而 s(Cin(1,2,...,k))=n+2k12ks(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil,除了当 (nmod4k=2k+1kmod2=1)n=2k+1(n \bmod 4k = 2k+1 \wedge k\bmod 2=1) \vee n=2k+1 的情况,此时 s(Cin(1,2,...,k))=n+2k12k+1s(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil+1

关键词

引用

@article{arxiv.1111.0316,
  title  = {Irregular Labellings of Circulant Graphs},
  author = {Marcin Anholcer},
  journal= {arXiv preprint arXiv:1111.0316},
  year   = {2011}
}

备注

I already had submitted this paper when Cory Palmer suggested that the main proofs may be simplified. Our common paper is still in preparation (to appear in Discrete Mathematics, we hope). However, I decided to publish the original version here, as some ideas included in it are supposed to be used in my further works. On the other hand, maybe someone else would like to use it