Modern roman domination in graphs
Other Title(s)
الهيمنة الرومانية الحديثة في البيانات
Joint Authors
Umran, Ahmad Abd Ali
al-Huwayr, Hasan Jayad Sawadi
Source
Issue
Vol. 36, Issue 1A (30 Jun. 2018), pp.45-54, 10 p.
Publisher
University of Basrah College of Science
Publication Date
2018-06-30
Country of Publication
Iraq
No. of Pages
10
Main Subjects
Abstract EN
In this paper, “a Modern Roman Domination" is introduced, which is a new model of graph domination.
A modem Roman dominating function on a graph G = (V; E) is a labeling function/: V(G) — {0.1.2.3} such that every vertex with label 0 is adjacent to two vertices, one of them of label 2 and the other of label 3 .And every vertex with label 1 is adjacent to a vertex with label 2 or 3.
The weight of a modem Roman dominating function /is w(f) = Spev/(v).The "Modem Roman Domination Number"ymr(G) is the minimum f(V) = E„ev f(v) over all such functions ofG.
In this paper, some properties of this new model of graph domination are introduced.
American Psychological Association (APA)
Umran, Ahmad Abd Ali& al-Huwayr, Hasan Jayad Sawadi. 2018. Modern roman domination in graphs. Basrah Journal of Science،Vol. 36, no. 1A, pp.45-54.
https://search.emarefa.net/detail/BIM-904394
Modern Language Association (MLA)
Umran, Ahmad Abd Ali& al-Huwayr, Hasan Jayad Sawadi. Modern roman domination in graphs. Basrah Journal of Science Vol. 36, no. 1A (2018), pp.45-54.
https://search.emarefa.net/detail/BIM-904394
American Medical Association (AMA)
Umran, Ahmad Abd Ali& al-Huwayr, Hasan Jayad Sawadi. Modern roman domination in graphs. Basrah Journal of Science. 2018. Vol. 36, no. 1A, pp.45-54.
https://search.emarefa.net/detail/BIM-904394
Data Type
Journal Articles
Language
English
Notes
Record ID
BIM-904394
