Defensive k-alliances in graphs

Details Defensive k-alliances in graphs Defensive k-alliances in graphs

2006-11-07

arxiv.org/abs/math/0611180v2

Applied Mathematics Letters, 22 (2009) 96-100

Mathematics

Combinatorics

Scientific paper

10.1016/j.aml.2008.02.012

Let $\Gamma=(V,E)$ be a simple graph. For a nonempty set $X\subseteq V$, and a vertex $v\in V$, $\delta_{X}(v)$ denotes the number of neighbors $v$ has in $X$. A nonempty set $S\subseteq V$ is a \emph{defensive $k$-alliance} in $\Gamma=(V,E)$ if $\delta_S(v)\ge \delta_{\bar{S}}(v)+k,$ $\forall v\in S.$ The defensive $k$-alliance number of $\Gamma$, denoted by $a_k(\Gamma)$, is defined as the minimum cardinality of a defensive $k$-alliance in $\Gamma$. We study the mathematical properties of $a_k(\Gamma)$.

Affiliated with

Also associated with

No associations

Rating

Defensive k-alliances in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Defensive k-alliances in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Defensive k-alliances in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-617855