Geodesic
Edge domination in graphs of cubes
Czechoslovak Mathematical Journal, Tome 52 (2002) no. 4, pp. 875-879
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the $n$-dimensional cube $Q_n$.
The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the $n$-dimensional cube $Q_n$.
Classification : 05C35, 05C69
Keywords: signed edge domination number; signed total edge domination number; graph of the cube of dimension $n$ 
@article{CMJ_2002_52_4_a17,
     author = {Zelinka, Bohdan},
     title = {Edge domination in graphs of cubes},
     journal = {Czechoslovak Mathematical Journal},
     pages = {875--879},
     year = {2002},
     volume = {52},
     number = {4},
     mrnumber = {1940066},
     zbl = {1009.05102},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2002_52_4_a17/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Edge domination in graphs of cubes
JO  - Czechoslovak Mathematical Journal
PY  - 2002
SP  - 875
EP  - 879
VL  - 52
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/CMJ_2002_52_4_a17/
LA  - en
ID  - CMJ_2002_52_4_a17
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T Edge domination in graphs of cubes
%J Czechoslovak Mathematical Journal
%D 2002
%P 875-879
%V 52
%N 4
%U http://geodesic.mathdoc.fr/item/CMJ_2002_52_4_a17/
%G en
%F CMJ_2002_52_4_a17
Zelinka, Bohdan. Edge domination in graphs of cubes. Czechoslovak Mathematical Journal, Tome 52 (2002) no. 4, pp. 875-879. http://geodesic.mathdoc.fr/item/CMJ_2002_52_4_a17/

[1] J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater: Signed domination in graphs. In: Graph Theory, Combinatorics and Applications, Y. Alavi, A. J. Schwenk (eds.) vol. 1, Proc. 7th Internat. Conf. Combinatorics, Graph Theory, Applications, John Wiley & Sons, Inc., 1995, pp. 311–322. | MR

[2] T. Dvořák, I. Havel, J.-M. Laborde and P. Liebl: Generalized hypercubes and graph embedding with dilation. Rostocker Mathematisches Kolloquium 39 (1990), 13–20. | MR

[3] R. Forcade: Smallest maximal matchings in the graph of the $n$-dimensional cube. J.  Combin. Theory Ser. B 14 (1973), 153–156. | MR

[4] I. Havel and M. Křivánek: On maximal matchings in  $Q_6$ and a conjecture of R. Forcade. Comment Math. Univ. Carolin. 23 (1982), 123–136. | MR

[5] T. W. Haynes, S. T. Hedetniemi and P. J. Slater: Fundamentals of Domination in Graphs. Marcel Dekker, Inc., New York-Basel-Hong Kong, 1998. | MR

[6] C. Payan: On the chromatic number of cube-like graphs. Discrete Math. 103 (1992), 272–277. | MR | Zbl

[7] B. Xu: On signed edge domination numbers of graphs. Discrete Math. 239 (2001), 179–189. | DOI | MR | Zbl

[8] B. Zelinka: On signed edge domination numbers of trees. Math. Bohem. 127 (2002), 49–55. | MR | Zbl