Completely Regular Clique Graphs
Completely Regular Clique Graphs
复制标题
完全正则派图
DOI：
10.1007/s10801-013-0485-2
复制
发表时间：
2014
影响因子：
0.8
通讯作者：
Hiroshi Suzuki
中科院分区：
文献类型：
--
作者：
Takashi Agoh;Karl Dilcher;S.Yoshiara;H.Taniguchi and S.Yoshiara;Hiroshi Suzuki
设Γ=（X，R）是连通图.则称Γ是参数（s，c）的完全正则团图，其中s ≥1，c ≥1，如果存在一个大小为+1的完全正则团的集合，使得每一条边恰好包含在的c个成员中.本文证明了完全正则码的参数不依赖于，作为一个副产品，我们得到了所有完全正则团图都是距离正则的，当完全正则团图不包含边时。研究了距离正则图的情形，证明了距离正则图是完全正则团图当且仅当它是距离半正则图的二部半图.
LetΓ=(X,R) be a connected graph. ThenΓis said to be a completely regular clique graph of parameters (s,c) withs≥1 andc≥1, if there is a collectionof completely regular cliques of sizes+1 such that every edge is contained in exactlycmembers of. In this paper, we show that the parameters ofas a completely regular code do not depend on. As a by-product we have that all completely regular clique graphs are distance-regular wheneverconsists of edges. We investigate the case whenΓis distance-regular, and show thatΓis a completely regular clique graph if and only if it is a bipartite half of a distance-semiregular graph.