The competition numbers of Hamming graphs with diameter at most three

Details The competition numbers of Hamming graphs with diameter at most three The competition numbers of Hamming graphs with diameter at most three

2010-11-11

arxiv.org/abs/1011.2591v1

Journal of the Korean Mathematical Society 48 (2011) 691-702

Mathematics

Combinatorics

12 pages, 1 figure

Scientific paper

10.4134/JKMS.2011.48.4.691

The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G and it has been one of important research problems in the study of competition graphs. In this paper, we compute the competition numbers of Hamming graphs with diameter at most three.

Affiliated with

Also associated with

No associations

Rating

The competition numbers of Hamming graphs with diameter at most three 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 Hamming graphs with diameter at most three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The competition numbers of Hamming graphs with diameter at most three will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430687