| Randomly Orthogonal (p, f)-factorizations in Graphs |
| |
| 作者姓名： | Gui-zhen Liu He-ping Long |
| |
| 作者单位： | Gui-zhen Liu，He-ping LongDepartment of Mathematics，Shandong University，Jinan 250100，ChinaDepartment of Mathematics，Shandong University at Weihai，Weihai 264209，China |
| |
| 基金项目： | the National Natural Science Foundation of China (No.60172003,19831080) by NSF of Shandong Province. |
| |
| 摘 要： | Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valued 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 κ-orthogonal to H and shown that the result is best possible.
|
Randomly Orthogonal (p, f)-factorizations in Graphs |
| |
| Gui-zhen Liu,He-ping Long.Randomly Orthogonal (p, f)-factorizations in Graphs[J].Acta Mathematicae Applicatae Sinica,2002(3). |
| |
| Authors: | Gui-zhen Liu He-ping Long |
| |
| Institution: | Gui-zhen Liu,He-ping LongDepartment of Mathematics,Shandong University,Jinan 250100,ChinaDepartment of Mathematics,Shandong University at Weihai,Weihai 264209,China |
| |
| Abstract: | |
| |
| Keywords: | Graph (g f)-factorization randomly fc-orthogonal factorization |
| 本文献已被 CNKI 等数据库收录！ |
