The competition numbers of ternary Hamming graphs
The competition numbers of ternary Hamming graphs
复制标题
三元汉明图的竞争数
DOI：
10.1016/j.aml.2011.04.012
复制
发表时间：
2011
影响因子：
3.7
通讯作者：
Yoshio SANO
中科院分区：
文献类型：
--
作者：
Boram PARK;Yoshio SANO
图G的竞争数k（G）的计算一般是一个困难的问题。Park和佐野（出版中）[16]给出了当1≤ n≤ 3或1≤ q≤ 2时Hamming图H（n，q）的竞争数的精确值.本文给出了三元Hamming图的竞争数的一个显式公式。
It is known to be a hard problem to compute the competition number k (G) of a graph G in general. Park and Sano (in press)[16] gave the exact values of the competition numbers of Hamming graphs H (n, q) if 1≤ n≤ 3 or 1≤ q≤ 2. In this paper, we give an explicit formula for the competition numbers of ternary Hamming graphs.