Domination in graphs with few edges
Mathematica Bohemica, Tome 120 (1995) no. 4, pp. 405-410
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the signed domination number $\g_s (G)$ and the minus domination number $\g^-(G)$. These numerical invariants are compared for graphs in which the degrees of vertices do not exceed 3.
DOI :
10.21136/MB.1995.126090
Classification :
05C35
Keywords: domination number; numerical invariants; signed domination number; minus domination number
Keywords: domination number; numerical invariants; signed domination number; minus domination number
@article{10_21136_MB_1995_126090, author = {Zelinka, Bohdan}, title = {Domination in graphs with few edges}, journal = {Mathematica Bohemica}, pages = {405--410}, publisher = {mathdoc}, volume = {120}, number = {4}, year = {1995}, doi = {10.21136/MB.1995.126090}, mrnumber = {1415088}, zbl = {0844.05058}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1995.126090/} }
Zelinka, Bohdan. Domination in graphs with few edges. Mathematica Bohemica, Tome 120 (1995) no. 4, pp. 405-410. doi: 10.21136/MB.1995.126090
Cité par Sources :