Computing the strong alliance polynomial of a graph

Abstract

We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):={\sum }_{i=a(G)}^n{a}_i(G)x^i$, where $a_k(G)$ is the number of strong defensive alliances with cardinality $k$ in $G$. We obtain some properties of $a(G;x)$ and its coefficients. In particular, we compute strong alliance polynomial for path, cycle, complete, start, complete bipartite and double star graphs; some of them verify unimodality.

Article accepted for publication in Investigacion Operacional

References in corpus (1)

• Computing the alliance polynomial of a graph