COMPUTING THE STRONG ALLIANCE POLYNOMIAL OF A GRAPH

W. Carballosa, J. C. Hernández-Gómez, O. Rosario, Y. Torres-Nuñez

Resumen


We introduce the strong alliance polynomial of a graph. We obtain some properties of the strong
alliance polynomial of a graph and its coecients. In particular, we compute strong alliance polyno-
mial for path, cycle, complete, start, complete bipartite and double star graphs; some of them verify
unimodality.

Texto completo:

PDF

Enlaces refback

  • No hay ningún enlace refback.