两个团图的笛卡尔积的识别码
组合数学
2014-12-09 v5
摘要
图 中的识别码是一个支配集 ，使得 中每个顶点的闭邻域与 的交集各不相同。2008 年，Gravier 等人确定了两个相同大小团图的笛卡尔积的识别码的最小基数。在本注记中，我们将此结果推广到任意两个非平凡团图的笛卡尔积。
引用
@article{arxiv.1305.5148,
title = {Identifying codes of Cartesian product of two cliques},
author = {Yingnan Zhang and Min Feng and Kaishun Wang},
journal= {arXiv preprint arXiv:1305.5148},
year = {2014}
}
备注
This paper has been withdrawn by the authors. This result has been obtained by others