[1]Igor E Zverovich, Vadim E Zverovich. A semiinduced subgraph character ization of upper domination perfect graphs.J Graph Theory,1999,31:  29-49

[2]Bondy  J A, Murty U S R.Graph Theory with Applications.Amsterdam:  NorthHolland,  1976, 14

[3]Cockayne E J,Favaron O,Payan C,Thomason A G.Contributions to t heory of domination,independence and irredundance in graphs.Discrete Match,1981,33:249-258

[4]Cockayne E J, Hedetniemi  S T, Miller D J.  Properties of heredit ary hypergraph and middle graphs. Canad Math Bull,  1978, 21: 461-46 8

[5]Cockayne E J, Mynhardt C M. The sequence of upper and lower domination,  independence and irredundance number of a graph.Discrete Math, 1993,122:89-102

[6]Dieter Rautenbach.On the difference between the upper irredundance, upper domination and independence number of a graph.Discrete Math, 1999,203: 239-252
[7]Bondy J A, Murty U S R. Graph Theory with Applications. London: The Macmi llan Press LTD, 1976