The competition numbers of ternary Hamming graphs

被引：9

作者：

Park, Boram ^{[1
]}

Sano, Yoshio ^{[2
]}

机构：

[1] Seoul Natl Univ, Dept Math Educ, Seoul 151742, South Korea

[2] POSTECH, Pohang Math Inst, Pohang 790784, South Korea

来源：

APPLIED MATHEMATICS LETTERS | 2011年 / 24卷 / 09期

关键词：

Competition graph; Competition number; Edge clique cover; Hamming graph;

D O I：

10.1016/j.aml.2011.04.012

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

It is 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. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：1608 / 1613

页数：6

共 17 条

[11] The m-step competition graphs of doubly partial orders [J].

Park, Boram ;

Lee, Jung Yeun ;

Kim, Suh-Ryung .

APPLIED MATHEMATICS LETTERS, 2011, 24 (06) :811-816

[12] The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares [J].

Park, Boram ;

Kim, Suh-Ryung ;

Sano, Yoshio .

DISCRETE MATHEMATICS, 2009, 309 (23-24) :6464-6469

[13]

Roberts F. S., 1978, Theory and applications of graphs, P477

[14]

ROBERTS FS, 1976, THEOR APPL GRAPHS P, P477

[15]

SANO Y, 2009, C NUMERANTI, V198, P211

[16]

Zhao YQ, 2010, ARS COMBINATORIA, V97, P457

[17] Note on the m-step competition numbers of paths and cycles [J].

Zhao, Yongqiang ;

Chang, Gerard J. .

DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) :1953-1958

← 1 2 →