Title of article
The competition numbers of ternary Hamming graphs
Author/Authors
Park، نويسنده , , Boram and Sano، نويسنده , , Yoshio، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
1608
To page
1613
Abstract
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.
Keywords
Competition graph , Competition number , Edge clique cover , Hamming graph
Journal title
Applied Mathematics Letters
Serial Year
2011
Journal title
Applied Mathematics Letters
Record number
1528006
Link To Document