搜索结果: 1-1 共查到“代数学 Diameter”相关记录1条 . 查询时间(0.16 秒)
The competition numbers of Hamming graphs with diameter at most three
Hamming graphs diameter
font style='font-size:12px;'>
2010/11/18
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. ...