Previous |  Up |  Next

Article

Title: Signed domination numbers of directed graphs (English)
Author: Zelinka, Bohdan
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 55
Issue: 2
Year: 2005
Pages: 479-482
Summary lang: English
.
Category: math
.
Summary: 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. (English)
Keyword: signed dominating function
Keyword: signed domination number
Keyword: directed graph
Keyword: tournament
Keyword: directed Hamiltonian cycle
MSC: 05C20
MSC: 05C45
MSC: 05C69
idZBL: Zbl 1081.05042
idMR: MR2137154
.
Date available: 2009-09-24T11:24:44Z
Last updated: 2020-07-03
Stable URL: http://hdl.handle.net/10338.dmlcz/127994
.
Reference: [1] J. F. Dunbar, S. T. Hedetniemi, M. A. Henning and P.  J. Slater: Signed domination in graphs.In: Graph Theory, Combinatorics and Applications. Proc. 7th Internat. conf. Combinatorics, Graph Theory, Applications, Vol. 1, Y.  Alavi, A. J. Schwenk (eds.), John Wiley & Sons, Inc., 1995, pp. 311–322. MR 1405819
.

Files

Files Size Format View
CzechMathJ_55-2005-2_18.pdf 256.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo