Signed domination numbers of directed graphs

Bohdan Zelinka

Czechoslovak Mathematical Journal (2005)

  • Volume: 55, Issue: 2, page 479-482
  • ISSN: 0011-4642

Abstract

top
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.

How to cite

top

Zelinka, Bohdan. "Signed domination numbers of directed graphs." Czechoslovak Mathematical Journal 55.2 (2005): 479-482. <http://eudml.org/doc/30961>.

@article{Zelinka2005,
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.},
author = {Zelinka, Bohdan},
journal = {Czechoslovak Mathematical Journal},
keywords = {signed dominating function; signed domination number; directed graph; tournament; directed Hamiltonian cycle; signed dominating function; directed graph; tournament; directed Hamiltonian cycle},
language = {eng},
number = {2},
pages = {479-482},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Signed domination numbers of directed graphs},
url = {http://eudml.org/doc/30961},
volume = {55},
year = {2005},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Signed domination numbers of directed graphs
JO - Czechoslovak Mathematical Journal
PY - 2005
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 55
IS - 2
SP - 479
EP - 482
AB - 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.
LA - eng
KW - signed dominating function; signed domination number; directed graph; tournament; directed Hamiltonian cycle; signed dominating function; directed graph; tournament; directed Hamiltonian cycle
UR - http://eudml.org/doc/30961
ER -

References

top
  1. 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. (1995) MR1405819

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.