Signed domination numbers of directed graphs
Loading...
Date
2005
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Czechoslovak Mathematical Journal
Technical university of Liberec, Czech Republic
Technická Univerzita v Liberci
Technical university of Liberec, Czech Republic
Technická Univerzita v Liberci
Abstract
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. © Mathematical Institute, Academy of Sciences of Czech Republic 2005.
Description
Subject(s)
signed dominating function, signed domination number, directed graph, tournament, directed hamiltonian cycle
Citation
ISSN
0011-4642