Computing the strong alliance polynomial of a graph

MaRDI QIDQ6264081arXivFDO

Authors Walter Carballosa, Juan Carlos Hernández-Gómez, Omar Rosario, Yadira Torres-Nuñez

Publication date 30 July 2015

Published in arXiv

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Special sequences and polynomials (11B83)

arXiv classification

math.CO

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):=su{m}_{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.

This page was built for publication: Computing the strong alliance polynomial of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264081)