Signed domination numbers of directed graphs
Czechoslovak Mathematical Journal, Tome 55 (2005) no. 2, pp. 479-482
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments. It is proved that for digraphs with a directed Hamiltonian cycle the signed domination number may be arbitrarily small.
Classification :
05C20, 05C45, 05C69
Keywords: signed dominating function; signed domination number; directed graph; tournament; directed Hamiltonian cycle
Keywords: signed dominating function; signed domination number; directed graph; tournament; directed Hamiltonian cycle
@article{CMJ_2005__55_2_a17,
author = {Zelinka, Bohdan},
title = {Signed domination numbers of directed graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {479--482},
publisher = {mathdoc},
volume = {55},
number = {2},
year = {2005},
mrnumber = {2137154},
zbl = {1081.05042},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2005__55_2_a17/}
}
Zelinka, Bohdan. Signed domination numbers of directed graphs. Czechoslovak Mathematical Journal, Tome 55 (2005) no. 2, pp. 479-482. http://geodesic.mathdoc.fr/item/CMJ_2005__55_2_a17/