The competition numbers of ternary Hamming graphs

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 to characterize a graph by its competition number. In this paper, we give the exact values of the competition numbers of ternary Hamming graphs.

[1]  Suh-Ryung Kim,et al.  The competition numbers of complete tripartite graphs , 2008, Discret. Appl. Math..

[2]  Gerard J. Chang,et al.  Multicompetition numbers of some multigraphs , 2010, Ars Comb..

[3]  Jung Yeun Lee,et al.  The competition number of a graph whose holes do not overlap much , 2010, Discret. Appl. Math..

[4]  P. Rowlinson.  ALGEBRAIC GRAPH THEORY (Graduate Texts in Mathematics 207) By CHRIS GODSIL and GORDON ROYLE: 439 pp., £30.50, ISBN 0-387-95220-9 (Springer, New York, 2001). , 2002 .

[5]  Gerard J. Chang,et al.  Note on the m-step competition numbers of paths and cycles , 2009, Discret. Appl. Math..

[6]  Yoshio Sano.  The competition numbers of regular polyhedra , 2009 .

[7]  Suh-Ryung Kim,et al.  The Competition Number and its Variants , 1993 .

[8]  Boram Park,et al.  On competition numbers of complete multipartite graphs with partite sets of equal size , 2008 .

[9]  Boram Park,et al.  The m-step competition graphs of doubly partial orders , 2011, Appl. Math. Lett..

[10]  Boram Park,et al.  The competition numbers of Johnson graphs , 2010, Discuss. Math. Graph Theory.

[11]  Boram Park,et al.  The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares , 2009, Discret. Math..

[12]  Boram Park,et al.  THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE , 2011 .

[13]  Robert J. Opsut.  On the Computation of the Competition Number of a Graph , 1982 .

[14]  Gerard J. Chang,et al.  The competition number of a graph with exactly two holes , 2012, J. Comb. Optim..

[15]  Gerard J. Chang,et al.  The competition number of a graph with exactly h holes, all of which are independent , 2009, Discret. Appl. Math..

[16]  Fred S. Roberts,et al.  Food webs, competition graphs, and the boxicity of ecological phase space , 1978 .