Запис Детальніше

Twin signed domination numbers in directed graphs

Vernadsky National Library of Ukraine

Переглянути архів Інформація
 
 
Поле Співвідношення
 
Title Twin signed domination numbers in directed graphs
 
Creator Atapour, M.
Norouzian, S.
Sheikholeslami, S.M.
Volkmann, L.
 
Description Let D=(V,A) be a finite simple directed graph (shortly digraph). A function f:V⟶{−1,1} is called a twin signed dominating function (TSDF) if f(N⁻[v])≥1 and f(N⁺[v])≥1 for each vertex v∈V. The twin signed domination number of D is γs*(D)=min{ω(f)∣f is a TSDF of D}. In this paper, we initiate the study of twin signed domination in digraphs and we present sharp lower bounds for γs*(D) in terms of the order, size and maximum and minimum indegrees and outdegrees. Some of our results are extensions of well-known lower bounds of the classical signed domination numbers of graphs.
 
Date 2019-06-18T10:24:09Z
2019-06-18T10:24:09Z
2017
 
Type Article
 
Identifier Twin signed domination numbers in directed graphs / M. Atapour, S. Norouzian, S.M. Sheikholeslami, L. Volkmann // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 1. — С. 71-89. — Бібліогр.: 10 назв. — англ.
1726-3255
2010 MSC:05C69.
http://dspace.nbuv.gov.ua/handle/123456789/156254
 
Language en
 
Relation Algebra and Discrete Mathematics
 
Publisher Інститут прикладної математики і механіки НАН України