Signed total domination number of a graph

Simple item page
dc.contributor.authorZelinka, Bohdan
dc.date.accessioned2015-10-26
dc.date.available2015-10-26
dc.date.issued2001
dc.description.abstractThe signed total domination number of a graph is a certain variant of the domination number. If v is a vertex of a graph G, then N(v) is its oper neighbourhood, i.e. the set of all vertices adjacent to v in G. A mapping f : V(G) → {-1, 1}, where V(G) is the vertex set of G, is called a signed total dominating function (STDF) on G, if ∑x∈N(v) f(x) ≥ 1 for each v ∈ V(G). The minimum of values ∑x∈V(G) f(x), taken over all STDF's of G, is called the signed total domination number of G and denoted by γst(G). A theorem stating lower bounds for γst(G) is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on n-side prisms. At the end it is proved that γst(G) is not bounded from below in general.en
dc.formattext
dc.identifier.issn0011-4642
dc.identifier.scopus2-s2.0-23044528767
dc.identifier.urihttps://dspace.tul.cz/handle/15240/13332
dc.language.isoen
dc.publisherTechnická Univerzita v Libercics
dc.publisherTechnical university of Liberec, Czech Republicen
dc.relation.ispartofAnnales de Chimie: Science des Materiaux
dc.relation.ispartofCzechoslovak Mathematical Journalen
dc.sourcej-scopus
dc.subjectcartesian product of graphsen
dc.subjectcircuiten
dc.subjectcomplete bipartite graphen
dc.subjectcomplete graphen
dc.subjectregular graphen
dc.subjectsigned total dominating functionen
dc.subjectsigned total domination numberen
dc.titleSigned total domination number of a graphen
dc.typeArticle
local.citation.epage229
local.citation.spage225
local.facultyFaculty of Sciences, Humanities and Education
local.fulltextyes
local.relation.issue2
local.relation.volume51
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2-s2.0-23044528767.pdf
Size:
242.7 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections