چکیده مقاله
The concept of majority domination in graphs has been defined in at least two different ways: As a functionand as a set In this work we extend the latter concept to digraphs, while we extended the former inanother paper Given a digraph D = V;A ; a set S V is a majority out dominating set MODS of D if jN S j n2 : The minimum cardinality of a majority out dominating set in D is the set majorityout domination number m D of D: In this work we introduce these concepts and prove some results aboutthem, among which the characterization of minimal MODSs
نویسندگان
Reza Jafary
Department of Mathematics Islamic Azad University of Miandoab, Iran
karam ebadi
Technical Institute of Urmia Shahid Beheshti Faculty, Technical Vocational Iran
شیوه ارجاع
Jafary, Reza and ebadi, karam,1395,MAJORITY DOMINATION IN DIGRAPHS,8th National Conference on Mathematics, Payame Noor University
ارائهشده در
مجموعه مقالات هشتمین همایش ملی ریاضی دانشگاه پیام نور22 اردیبهشت 1395