-
48浏览
-
0点赞
-
0收藏
-
0分享
-
63下载
-
0评论
-
引用
期刊论文
Randomly Orthogonal (g, f)-Factorizations in graphs1
,-0001,():
G) and edge set E(G) and let g and f be two integervalued functions defined on V (G) such that 2k−1≤g(x)≤f(x) for all x∈V (G). Let H be a subgraph of G with mk edges. In this paper it is proved that every (mg+m−1,mf−m+1)-graph G has (g, f)-factorizations randomly k-orthogonal to H and shown that the result is best possible.
【免责声明】以下全部内容由[刘桂真]上传于[2005年07月21日 23时16分41秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果