|
|
|
|
ON THE DEFENSIVE ALLIANCES IN GRAPH
|
|
|
|
|
|
|
|
نویسنده
|
kharazi hasan ,mosleh tehrani alireza
|
|
منبع
|
transactions on combinatorics - 2019 - دوره : 8 - شماره : 1 - صفحه:1 -14
|
|
چکیده
|
let g=(v,e) be a graph. we say that s⊆v is a defensive alliance if for every u∈s, the number of neighbors u has in s plus one (counting u) is at least as large as the number of neighbors it has outside s. then, for every vertex u in a defensive alliance s, any attack on a single vertex by the neighbors of u in v−s can be thwarted by the neighbors of u in s and u itself. in this paper, we study alliances that are containing a given vertex u and study their mathematical properties.
|
|
کلیدواژه
|
Defensive alliance; Alliances in graphs; Edge cut.
|
|
آدرس
|
iran university of science and technology, department of mathematics, Iran, iran university of science and technology, department of mathematics, Iran
|
|
پست الکترونیکی
|
amtehrani@iust.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|