Signed domination numbers of directed graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24510%2F05%3A%230000227" target="_blank" >RIV/46747885:24510/05:#0000227 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Signed domination numbers of directed graphs

Original language description

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 thatfor digraphs with a directed Hamiltonian cycle the signed domination number may be arbitrarily small.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

CZECHOSLOVAK MATHEMATICAL JOURNAL

ISSN

0011-4642

e-ISSN

—

Volume of the periodical

55

Issue of the periodical within the volume

2

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

4

Pages from-to

—

UT code for WoS article

956TQ

EID of the result in the Scopus database

—