On f -domination number of a graph

San Ming Zhou

Czechoslovak Mathematical Journal (1996)

  • Volume: 46, Issue: 3, page 489-499
  • ISSN: 0011-4642

How to cite

top

Zhou, San Ming. "On $f$-domination number of a graph." Czechoslovak Mathematical Journal 46.3 (1996): 489-499. <http://eudml.org/doc/30324>.

@article{Zhou1996,
author = {Zhou, San Ming},
journal = {Czechoslovak Mathematical Journal},
keywords = {-domination number; -independence number},
language = {eng},
number = {3},
pages = {489-499},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On $f$-domination number of a graph},
url = {http://eudml.org/doc/30324},
volume = {46},
year = {1996},
}

TY - JOUR
AU - Zhou, San Ming
TI - On $f$-domination number of a graph
JO - Czechoslovak Mathematical Journal
PY - 1996
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 46
IS - 3
SP - 489
EP - 499
LA - eng
KW - -domination number; -independence number
UR - http://eudml.org/doc/30324
ER -

References

top
  1. 10.1155/S016117129000031X, Internat. J. Math. & Math. Sci. 13 (1990), no. 1, 205–206. (1990) MR1038667DOI10.1155/S016117129000031X
  2. 10.1007/BF02760037, Israel J. of Mathematics 3 (1965), 113–116. (1965) MR0190027DOI10.1007/BF02760037
  3. 10.1016/0095-8956(85)90040-1, J. of Combinatorial Theory, Ser B 39 (1985), 101–102. (1985) Zbl0583.05049MR0805459DOI10.1016/0095-8956(85)90040-1
  4. n -domination in graphs, Graph Theory with Applications to Algorithms and Computer Science, John Wiley & Sons, New York, 1985, pp. 283–300. (1985) MR0812671
  5. 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. (1985) MR0812672
  6. 10.1016/S0095-8956(73)80009-7, J. of Combinatorial Theory, Ser B 14 (1973), 94–99. (1973) MR0316313DOI10.1016/S0095-8956(73)80009-7
  7. Relations du type Nordhaus–Gaddum pour le nombre d’absorption d’un graphe simple, CR Acad. Sci., Ser. A 274 (1972), 728–730. (1972) MR0294161
  8. 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. (1981) MR0655630
  9. 10.1002/jgt.3190170306, J. Graph Theory 17 (1993), no. 3, 315–323. (1993) MR1220992DOI10.1002/jgt.3190170306

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.