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: 1897
Download times: 757
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