Geodesic
On $f$-domination number of a graph
Czechoslovak Mathematical Journal, Tome 46 (1996) no. 3, pp. 489-499
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1996.127310
Classification : 05C35, 05C70 
@article{10_21136_CMJ_1996_127310,
     author = {Zhou, Sanming},
     title = {On $f$-domination number of a graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {489--499},
     year = {1996},
     volume = {46},
     number = {3},
     doi = {10.21136/CMJ.1996.127310},
     mrnumber = {1408300},
     zbl = {0879.05037},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127310/}
}
TY  - JOUR
AU  - Zhou, Sanming
TI  - On $f$-domination number of a graph
JO  - Czechoslovak Mathematical Journal
PY  - 1996
SP  - 489
EP  - 499
VL  - 46
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127310/
DO  - 10.21136/CMJ.1996.127310
LA  - en
ID  - 10_21136_CMJ_1996_127310
ER  - 
%0 Journal Article
%A Zhou, Sanming
%T On $f$-domination number of a graph
%J Czechoslovak Mathematical Journal
%D 1996
%P 489-499
%V 46
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127310/
%R 10.21136/CMJ.1996.127310
%G en
%F 10_21136_CMJ_1996_127310
Zhou, Sanming. On $f$-domination number of a graph. Czechoslovak Mathematical Journal, Tome 46 (1996) no. 3, pp. 489-499. doi: 10.21136/CMJ.1996.127310

[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. | DOI | MR

[2] P. Erdös: On some extremal problems in graph theory. Israel J. of Mathematics 3 (1965), 113–116. | DOI | MR

[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. | DOI | MR | Zbl

[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. | MR

[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. | MR

[6] S.T. Hedetniemi: Hereditary properties of graphs. J. of Combinatorial Theory, Ser B 14 (1973), 94–99. | DOI | MR

[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. | MR

[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. | MR

[9] C. Stracke and L. Volkmann: A new domination conception. J. Graph Theory 17 (1993), no. 3, 315–323. | DOI | MR

Cité par Sources :