检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:WU Yan & CHANG YanXun Institute of Mathematics,Beijing Jiaotong University,Beijing 100044,China
出 处:《Science China Mathematics》2009年第11期2537-2548,共12页中国科学:数学(英文版)
基 金:supported by National Natural Science Foundation of China (Grant Nos. 10771013, 10831002)
摘 要:A t-hyperwheel(t≥3) of length l(or W l(t) for brevity) is a t-uniform hypergraph(V,E) ,where E = {e1,e2,. . .,el} and v1,v2,. . .,vl are distinct vertices of V = il=1 ei such that for i = 1,. . .,l,vi,vi+1 ∈ ei and ei ∩ ej = P,j ∈/{i-1,i,i + 1},where the operation on the subscripts is modulo l and P is a vertex of V which is different from vi,1 i l. In this paper,we investigate the maximum packing problem of MPλ(3,W 4( 3) ,v) . Finally,the packing number Dλ(3,W 4( 3) ,v) is determined for any positive integers v 5 and λ.A t-hyperwheel(t≥3) of length l(or W l(t) for brevity) is a t-uniform hypergraph(V,E) ,where E = {e1,e2,. . .,el} and v1,v2,. . .,vl are distinct vertices of V = il=1 ei such that for i = 1,. . .,l,vi,vi+1 ∈ ei and ei ∩ ej = P,j ∈/{i-1,i,i + 1},where the operation on the subscripts is modulo l and P is a vertex of V which is different from vi,1 i l. In this paper,we investigate the maximum packing problem of MPλ(3,W 4( 3) ,v) . Finally,the packing number Dλ(3,W 4( 3) ,v) is determined for any positive integers v 5 and λ.
关 键 词:t-(v Γ λ) PACKING LEAVE PACKING NUMBER GROUP divisible(Γ t) -design candelabra(Γ t) -system
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31