On (g,f)-2-Deleted Graphs
Received:July 02, 1997  Revised:July 09, 1999
Key Words: graph   factor   deleted graph.  
Fund Project:
Author NameAffiliation
WANG Changping Dept. of Math. & Phys., Wuhan University of Hydraulic & Electric Engineering, 430072, China 
JI Chang-ming Dept. of Math. & Phys., Wuhan University of Hydraulic & Electric Engineering, 430072, China 
Hits: 1991
Download times: 804
Abstract:
      A graph G is called a (g,f)-2-deleted graph if every two edges don′t belong to a (g,f)-factor.In this paper a necessary and sufficient condition for a graph to be (g,f)-2-deleted is given when g＜f.
Citation:
DOI:10.3770/j.issn:1000-341X.2000.04.029
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.