Signed domination numbers of directed graphs

Simple item page
dc.contributor.authorZelinka, Bohdan
dc.date.accessioned2015-10-26
dc.date.available2015-10-26
dc.date.issued2005
dc.description.abstractThe 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.en
dc.formattext
dc.identifier.doi10.1007/s10587-005-0038-5
dc.identifier.issn0011-4642
dc.identifier.scopus2-s2.0-21444450209
dc.identifier.urihttps://dspace.tul.cz/handle/15240/13320
dc.language.isoen
dc.publisherCzechoslovak Mathematical Journal
dc.publisherTechnical university of Liberec, Czech Republicen
dc.publisherTechnická Univerzita v Libercics
dc.relation.ispartofCzechoslovak Mathematical Journalen
dc.sourcej-scopus
dc.sourcej-wok
dc.subjectsigned dominating functionen
dc.subjectsigned domination numberen
dc.subjectdirected graphen
dc.subjecttournamenten
dc.subjectdirected hamiltonian cycleen
dc.titleSigned domination numbers of directed graphsen
dc.typeArticle
local.citation.epage482
local.citation.spage479
local.facultyFaculty of Sciences, Humanities and Education
local.fulltextyes
local.identifier.wok231323100018
local.relation.issue2
local.relation.volume55
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2-s2.0-21444450209.pdf
Size:
79.15 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections