J4

• Articles • Previous Articles     Next Articles

g, f)Factors and ffactors with constraints in bipartite graphs

HOU Jian-feng1，WANG Ji-hui2，and LIU Gui-zhen1   

  1. 1.School of Math. & System Sci., Shangdong Univ.，Jinan 250100；2.School of Science, Jinan Univ.,Jinan 250022, Shandong, China
  • Received:2005-06-28 Revised:2005-08-30 Online:2006-10-24 Published:2006-10-24
  • Contact: HOU Jian-feng

Abstract: Let G=(X,Y,E) be a bipartite graph and let g and f be two positive integer functions defined on V(G) with g(x)＜f(x) for each x∈V(G). It is proved that if a G is the (mg,mf-1)-graph and M is a mathing with m edges, then G has a (g,f)-factor containing an edge of M and excluding other edges of M. If G is the (2m-1)-edge connected bipartite (mf)-graph, then G has an f-factor containing any given edge and excluding any given m-1 edges.

Key words: f)-factorization , (g, f-factor, f)-factor, (g, bipartite graph

CLC Number: 

  • O157.5
[1] GUO Hong-feng, LI Yu-si, SUN Wei-hua. D-properties of Finite unions of spaces with point countable weak bases and satisfying open(G) [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(10): 72-76.
[2] LI Shi-ling, CHEN Xiang-en, WANG Zhi-wen. Vertex-Distinguishing E-Total coloring of complete bipartite graph K3,n with n≥18 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 68-71.
[3] GAO Chao, HOU Xin-min*. Some remarks on maximum size of bipartite graphs with a given domination number [J]. J4, 2013, 48(8): 21-23.
[4] SHEN Zhong-lan1, YUAN Dong2, WANG Mao-sen1, TUO Ying-ying3, ZHANG Hong-xia1, SHENG Jian-wei1, ZHANG Hui1, ZHU Jian-hua1. Uncertainty estimation in determination of polychlorinated biphenyls in  tuna by stable isotope dilution gas chromatographymass spectrometry [J]. J4, 2013, 48(05): 34-38.
[5] CHEN Hong-yu1,2, ZHANG Li3. Maximum number of edges in connected bipartite graphs with  a given domination number [J]. J4, 2012, 47(8): 11-15.
[6] YANG Lin1, SUN Lei2*. Some ［r,s,t］-chromatic number of graphs [J]. J4, 2012, 47(6): 80-82.
[7] LI Zhen-lin, LU Jun-long, L Xin-zhong. On signed edge total domination of graphs [J]. J4, 2012, 47(6): 83-86.
[8] CAO Lei1,2, GUO Jia-feng1, CHENG Xue-qi1. Bipartite graph based semi-supervised method for entity mining from the query log [J]. J4, 2012, 47(5): 32-37.
[9] DING Lu-shun, YAN Jin. he Z3-connectivity for 3-regular graph [J]. J4, 2012, 47(12): 22-24.
[10] LI Ze-peng1, WANG Zhi-wen2, CHEN Xiang-en1*. Adjacent-vertex-distinguishing total coloring of planar bipartite graphs [J]. J4, 2011, 46(4): 4-8.
[11] LU Jian-li, CAI Wen-juan. The number of vertex-disjoint 6-cycles containing specified vertices in a balance bipartite graph [J]. J4, 2010, 45(12): 5-11.
[12] LIU Shu-li. Isolated toughness and existence of fractional (g, f)-factors in graphs [J]. J4, 2010, 45(10): 31-34.
[13] JU Jing-Song, LI Shuo, YANG Xin-Gang. Degree conditions for bipartite graphs to contain 6-cycles [J]. J4, 2009, 44(8): 13-15.
[14] . Vertex distinguishing IEtotal chromatic numbers of  complete bipartite graph K5,n [J]. J4, 2009, 44(2): 91-96.
[15] . On the spectrum of matching forcing numbers for bipartite graphs [J]. J4, 2009, 44(12): 30-35.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd