شماره ركورد كنفرانس :
4062
عنوان مقاله :
EDGE ROMAN DOMINATION AND INDUCED MATCHING IN GRAPHS
پديدآورندگان :
BEHMARAM A behmaram@tabrizu.ac.ir Faculty of Mathematical sciences, University of Tabriz, Tabriz, Iran , NASIRZADE S behmaram@tabrizu.ac.ir Sharif University of Technology,Tehran , SOLTANVASH M behmaram@tabrizu.ac.ir Faculty of Mathematical sciences, University of Tabriz, Tabriz, Iran
كليدواژه :
Edge Roman domination , Induced matching , Regular graph.
عنوان كنفرانس :
نهمين كنفرانس ملي نظريه گراف و تركيبيات جبري
چكيده فارسي :
An edge Roman dominating function of a graph G is a function f : E(G) −→
{ 0, 1, 2 } satisfying the condition that every edge e with f (e) = 0 is adjacent to some edge′
with f (e) = 2. The edge Roman domination number of G, denoted by γ re (G) , is the
minimum weight of w(f)=∑f(e) . In this paper , we find some relation between edge
roman dominationan and induced matching in graph. Using This relation, we proved
some upper and lower bound for the edge roman domination number in some graphs.
