arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.2591math.CO
收藏

直径不超过3的Hamming图的竞争数

The competition numbers of Hamming graphs with diameter at most three

Boram Park, Yoshio Sano

摘要:

有向图D的竞争图是具有与D相同的顶点集且在x和y之间有一条边的图当且仅当D中存在顶点v使得(x,v)和(y,v)是D的弧。对任意图G,G加上足够多的孤立点是某个无圈有向图的竞争图。图G的竞争数k(G)定义为此类孤立点的最小数目。一般来说,图G的竞争数k(G)是很难计算的,它一直是竞争图研究中的重要问题之一。本文计算了直径不超过3的Hamming图的竞争数。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑