On f-domination number of a graph

Czechoslovak Mathematical Journal

Volumn 46, Issue 3, 1996, Pages 489-499

  Zhou, Sanming ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031444858     PISSN: 00114642     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. Y. Caro and Y. Roditty: A note on the k-domination number of a graph. Internat. J. Math. & Math. Sci. 13 (1990), no. 1, 205-206.
2. P. Erdös: On some extremal problems in graph theory. Israel J. of Mathematics 3 (1965), 113-116.
3. O. Favaron: On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. J. of Combinatorial Theory, Ser B 39 (1985), 101-102.
4. J.F. Fink and M.S. Jacobson: n-domination in graphs. Graph Theory with Applications to Algorithms and Computer Science. John Wiley & Sons, New York, 1985, pp. 283-300.
5. J.F. Fink and M.S. Jacobson: On n-domination, n-dependence and forbidden subgraphs. Graph Theory with Applications to Algorithms and Computer Science. John Wiley & Sons, New York, 1985, pp. 301-311.
6. S.T. Hedetniemi: Hereditary properties of graphs. J. of Combinatorial Theory, Ser B 14 (1973), 94-99.
7. F. Jaeger and C. Payan: Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple. CR Acad. Sci., Ser. A 274 (1972), 728-730.
8. R. Laskar and H.B. Walikar: On domination related concepts in graph theory. Combinatorics and Graph Theory (S.B. Rao, ed.). Lecture Notes in Math. 885, Springer-Verlag, Berlin, Heidelberg, New York, 1981, pp. 308-320.
9. C. Stracke and L. Volkmann: A new domination conception. J. Graph Theory 17 (1993), no. 3, 315-323.