检索结果-南通市图书馆

P_(4k-1)-factorization of complete bipartite graphs

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2005年第4期48卷 539-547页

作者： du beiliang & wang jian Department of Mathematics, Suzhou University, Suzhou 215006, china nantong vocational college, nantong 226007, china Department of Mathematics Suzhou University Suzhou China nantong vocational college Nantong China

Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Pv-factorization of Km,n is a set of edge-disjoint pv-factors of Km,n which partition the set of edges of Km,n. When v is an even number, wang and Ushio gave a necessary and sufficient condition for the existence of Pv-factorization of Km,*** v is an odd number, Ushio in 1993 proposed a conjecture. However, up to now we only know that Ushio Conjecture is true for v = 3. In this paper we will show that Ushio Conjecture is true when v = 4k - 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P4k-1-factorization of Km,n is (1) (2k - 1)m ≤ 2kn, (2) (2k -1)n≤2km, (3) m + n ≡ 0 (mod 4k - 1), (4) (4k -1)mn/[2(2k -1)(m + n)] is an integer.

关键词： complete bipartite graph, factorization, Ushio Conjecture.

The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2006年第3期49卷 289-299页

Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Pv-factorization of Km,n is a set of edge-disjoint Pv-factors of Km,n which partition the set of edges of Km,n. When v is an even number, wang and Ushio gave a necessary and sufficient condition for existence of Pv-factorization of Km,n. When k is an odd number, Ushio in 1993 proposed a conjecture. Very recently, we have proved that Ushio's conjecture is true when v = 4k - 1. In this paper we shall show that Ushio Conjecture is true when v = 4k + 1, and then Ushio's conjecture is true. That is, we will prove that a necessary and sufficient condition for the existence of a P4k+1-factorization of Km,n is (i) 2km ≤ (2k + 1)n,(ii) 2kn ≤ (2k + 1)m, (iii) m + n ≡ 0 (mod 4k + 1), (iv) (4k + 1)mn/[4k(m + n)] is an integer.

关键词： complete bipartite graph, factorization, Ushio Conjecture.

K_(p,q)-factorization of complete bipartite graphs

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2004年第3期47卷 473-479页

作者： du beiliang wang jian Department of Mathematics, Suzhou University, Suzhou 215006, china nantong vocational college, nantong 226007, china Department of Mathematics Suzhou University Suzhou China nantong vocational college Nantong China

Let Km,n be a completebipartite graph with two partite sets having m and n vertices,respectively. A Kp,q-factorization of Km,n is a set ofedge-disjoint Kp,q-factors of Km,n which partition theset of edges of Km,n. When p=1 and q is a prime number,wang, in his paper 'On K1,k-factorizations of a completebipartite graph' (Discrete Math, 1994, 126: 359-364),investigated the K1,q-factorization of Km,n and gave asufficient condition for such a factorization to exist. In the paper'K1,k-factorizations of complete bipartite graphs' (DiscreteMath, 2002, 259: 301-306), du and wang extended wang's resultto the case that q is any positive integer. In this paper, we give a sufficient condition for Km,n to have aKp,q-factorization. As a special case, it is shown that theMartin's BAC conjecture is true when p:q=k:(k+1) for any positiveinteger k.

关键词： complete bipartite graph factorization HUBMFS 2 scheme

The spectrum of path factorization of bipartite multigraphs

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2007年第7期50卷 1045-1054页

作者： jian wang~1 Bei-liang du~(2+) 1 nantong vocational college,nantong 226007,china 2 Department of Mathematics,Suzhou University,Suzhou 215006,china nantong vocational college Nantong China Department of Mathematics Suzhou University Suzhou China

Let λK m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P v-factorization of λK m,n is a set of edge-disjoint P v-factors of λK m,n which partition the set of edges of λK m,n . When v is an even number, Ushio, wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P v-factorization of λK m,n . When v is an odd number, we have proposed a conjecture. Very recently, we have proved that the conjecture is true when v = 4k ? 1. In this paper we shall show that the conjecture is true when v = 4k + 1, and then the conjecture is true. That is, we will prove that the necessary and sufficient conditions for the existence of a P 4k+1-factorization of λK m,n are (1) 2km ? (2k + 1)n, (2) 2kn ? (2k + 1)m, (3) m + n ≡ 0 (mod 4k + 1), (4) λ(4k + 1)mn/[4k(m + n)] is an integer.

关键词： bipartite multigraph factorization 05B30 05C70

在线全文

学校读者我要写书评

暂无评论

微旦涤纶短纤维系列产品的设计

上海纺织科技 2004年第2期32卷 47-48页

作者：刘建平王德根南通职业大学江苏南通226007 海安纺织一厂江苏南通226671

根据服装面料市场需求 ,进行了微旦涤纶短纤维系列产品设计。

关键词：微旦涤纶短纤维产品设计服装面料生产工艺性能特点

在线全文

学校读者我要写书评

暂无评论

微旦涤纶纤维的纺纱工艺优化

上海纺织科技 2003年第5期31卷 11-12,15页

作者：刘建平王云其南通职业大学纺织系江苏南通226007 太仓棉纺厂江苏太仓215400

根据微旦涤纶纤维的性能特点 ,通过正交试验分析得出了生产微旦涤纶纱的优化工艺。

关键词：微旦涤纶纤维纺纱工艺工艺优化正交试验

Star-factorization of the Complete Bipartite Multigraphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2023年第2期39卷 239-248页

作者： Jing SHI jian wang Bei-liang du School of Science Nantong UniversityNantong 226007China Department of Mathematics Suzhou UniversitySuzhou 215006China Mathematics Teaching and Research Office Nantong Vocational CollegeNantong 226007China

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 *** 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.

关键词： complete bipartite multigraph star factorization

On K_(1,k)-factorization of bipartite multigraphs

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2008年第3期23卷 345-350页

作者： wang jian nantong vocational college Nantong 226007 China

A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that （1） m ≤ kn, （2） n ≤ km, （3） km-n = kn-m ≡ 0 （mod （k^2- 1）） and （4） λ（km-n）（kn-m） ≡ 0 （mod k（k- 1）（k^2 - 1）（m ＋ n））.

关键词： factor factorization bipartite multigraph

以强毅之力行其志——张謇近代商业职业教育实践的历史观照与当代审察

在线全文

学校读者我要写书评

暂无评论

江苏高职教育 2024年第4期24卷 59-67页

作者：黄正平王鑫蔡小柳江苏商贸职业学院马克思主义学院江苏南通226011

作为“爱国企业家的典范”的张謇,于19世纪末20世纪初在江苏南通拉开实业救国、教育救国的序幕,书写了“中国近代第一城”的辉煌。他敢为人先,勇于站在时代前列,在近代南通构建了相对完整、比较先进的教育体系,组织开展了丰富多彩、成... 详细信息

作为“爱国企业家的典范”的张謇,于19世纪末20世纪初在江苏南通拉开实业救国、教育救国的序幕,书写了“中国近代第一城”的辉煌。他敢为人先,勇于站在时代前列,在近代南通构建了相对完整、比较先进的教育体系,组织开展了丰富多彩、成效显著的兴商学、开商智教育活动,商业职业教育是其中一个重要的领域。由张謇为主所办商校的理念和实践活动影响深远,其“养成开门商战人才”“以强毅之力行其志”“道德优美,学术纯粹”“学必期于用,用必适于地”“祈通中西,力求精进”等诸多教育理念与丰富、生动的实践活动为新时代职教事业提供了历史基础和文化滋养,在今天仍然值得学习和借鉴。

关键词：职业教育商业张謇