2 research outputs found
The competition numbers of ternary Hamming graphs
It is known to be a hard problem to compute the competition number k(G) of a
graph G in general. Park and Sano [13] gave the exact values of the competition
numbers of Hamming graphs H(n,q) if or . In
this paper, we give an explicit formula of the competition numbers of ternary
Hamming graphs.Comment: 6 pages, 2 figure