The competition numbers of ternary Hamming graphs

Details The competition numbers of ternary Hamming graphs The competition numbers of ternary Hamming graphs

2010-06-14

arxiv.org/abs/1006.2628v2

Applied Mathematics Letters 24 (2011) 1608-1613

Mathematics

Combinatorics

6 pages, 2 figures

Scientific paper

10.1016/j.aml.2011.04.012

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 \leq n \leq 3$ or $1 \leq q \leq 2$. In
this paper, we give an explicit formula of the competition numbers of ternary
Hamming graphs.

Affiliated with

Also associated with

No associations

Rating

The competition numbers of ternary Hamming graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The competition numbers of ternary Hamming graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The competition numbers of ternary Hamming graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-421918