|
|
|
|
Graphs with large roman domination number
|
|
|
|
|
|
|
|
نویسنده
|
ahangar h.a. ,khaibari m.
|
|
منبع
|
malaysian journal of mathematical sciences - 2017 - دوره : 11 - شماره : 1 - صفحه:71 -81
|
|
چکیده
|
A roman dominating function (rdf) on a graph g = (v,e) is a function f: v(g) → (0,1,2) satisfying the condition that every vertex with label 0 is adjacent to a vertex with label 2. the weight of an rdf f is w(f) = ∑v∈v f (v). the roman domination number of g is the minimum weight of an rdf in g. in this article,we characterize all connected graphs g of order n whose roman domination number is n-1 or n-2.
|
|
کلیدواژه
|
Roman dominating function; Roman domination number
|
|
آدرس
|
department of mathematics,babol noshirvani university of technology, ایران, department of mathematics,babol noshirvani university of technology, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|