检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Jing SHI Jian WANG Bei-liang DU
机构地区:[1]School of Science,Nantong University,Nantong 226007,China [2]Department of Mathematics,Suzhou University,Suzhou 215006,China [3]Mathematics Teaching and Research Office,Nantong Vocational College,Nantong 226007,China
出 处:《Acta Mathematicae Applicatae Sinica》2023年第2期239-248,共10页应用数学学报(英文版)
基 金:supported by the National Natural Science Foundation of China (Grant No.K110703711)。
摘 要:LetλK_(m,n)be a complete bipartite multigraph with two partite sets having m and n vertices,respectively.A K_(p,q)-factorization ofλK_(m,n)is a set of K_(p,q)-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).Whenλ=1,Martin,in[Complete bipartite factorizations by complete bipartite graphs,Discrete Math.,167/168(1997),461–480],gave simple necessary conditions for such a factorization to exist,and conjectured those conditions are always sufficient.In this paper,we will study the K_(p,q)-factorization ofλK_(m,n)for p=1,to show that the necessary conditions for such a factorization are always sufficient whenever related parameters are sufficiently large.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38