|
|
|
|
the arrow domination in graphs
|
|
|
|
|
|
|
|
نویسنده
|
radhi suha j. ,abdlhusein mohammed a. ,hashoosh ayed e.
|
|
منبع
|
international journal of nonlinear analysis and applications - 2021 - دوره : 12 - شماره : 1 - صفحه:473 -480
|
|
چکیده
|
The arrow domination is introduced in this paper with its inverse as a new type of domination. let g be a finite graph, undirected, simple and has no isolated vertex, a set d of v (g) is said an arrow dominating set if |n(w) ∩ (v − d)| = i and |n(w) ∩ d| ≥ j for every w ∈ d such that i and j are two non-equal positive integers. the arrow domination number γar(g) is the minimum cardinality over all arrow dominating sets in g. essential properties and bounds of arrow domination and its inverse when i = 1 and j = 2 are proved. then, arrow domination number is discussed for several standard graphs and other graphs that formed by join and corona operations.
|
|
کلیدواژه
|
dominating set، arrow dominating set، arrow domination number
|
|
آدرس
|
university of thi-qar, college of education for pure sciences, department of mathematics, iraq, university of thi-qar, college of education for pure sciences, department of mathematics, iraq, university of thi-qar, college of education for pure sciences, department of mathematics, iraq
|
|
پست الکترونیکی
|
ayed.hashoosh@utq.edu.iq
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|