Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Orthogonal(g,f)-factorizations of bipartite(mg+k-1,mf-k+1)-graphs

ZHU Yan-yan~1,ZHANG Hong-jun~1,ZHOU Si-zhong~2,WANG Hui-dong~1,WANG Ya-bing~1(1.Engineering Insitute of Corps of Engineers,PLA Univ.of Sci.& Tech.,Nanjing 210007,China;2.Dept.of Math.and Phys.,Jiangsu Univ.of Sci.& Tech.,Zhenjiang 212003, China)  
The conjecture presented by WANG Chang-ping was proved to the bipartite graph by the normal methods of the factor theory.The result is that for any subgraph H with k edges of a bipartite(mg+k-1,mf-k+1)-graph G,1≤km,there exists a subgraph R with a(g,f)-factorization ort-hogonal to a(g,f)-factorization orthogonal to H.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved