Skip to main content
SpringerLink
Log in

Signed domination numbers of directed graphs

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics, Technical University of Liberec, Voronezska 13, 461 17, Liberec, Czech Republic

    Bohdan Zelinka

Authors
  1. Bohdan Zelinka
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zelinka, B. Signed domination numbers of directed graphs. Czech Math J 55, 479–482 (2005). https://doi.org/10.1007/s10587-005-0038-5

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10587-005-0038-5

Keywords

Search

Navigation