The competition numbers of ternary Hamming graphs
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 [13] 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 of the competition numbers of ternary Hamming graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.