The arrow edge domination in graphs | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 52، دوره 13، شماره 2، مهر 2022، صفحه 591-597 اصل مقاله (433.98 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.6390 | ||
| نویسندگان | ||
| Mohammed A. Abdlhusein؛ Suha J. Radhi* | ||
| College of Education for Pure Sciences, University of Thi-Qar, Thi-Qar, Iraq | ||
| چکیده | ||
| The idea of this paper is to study the arrow edge domination. The arrow edge dominating set $D_{e}$ of a graph $G$ is an arrow edge dominating set if every edge from $D$ dominates exactly one edge from $V-D$ and is adjacent to two or more edges from $D$. The arrow edge domination number $\gamma_{\text {are }}(G)$ is the minimum cardinality of all arrow edge dominating sets in $G$. Several properties and bounds are introduced here. Our results are applied in some graphs such that the path graph, cycle graph, complete graph, wheel graph, complete bipartite graph, Barbell graph, helm graph, big helm graph, complement path graph, complement cycle graph, the complement of complete graph and complement of complete bipartite graph. An important fact given here is if $G$ has no arrow vertex dominating set, then $G$ may have an arrow edge dominating set and an example is given. | ||
| کلیدواژهها | ||
| Arrow edge domination؛ edge domination؛ dominating set؛ path graph؛ cycle graph | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 44,644 تعداد دریافت فایل اصل مقاله: 51,497 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 721 |
| تعداد مقالات | 10,359 |
| تعداد مشاهده مقاله | 72,761,957 |
| تعداد دریافت فایل اصل مقاله | 64,423,373 |