Computing the strong alliance polynomial of a graph Article

Carballosa, W, Hernandez-Gomez, JC, Rosario, O et al. (2016). Computing the strong alliance polynomial of a graph . Investigacion Operacional, 37(2), 115-123.

cited authors

  • Carballosa, W; Hernandez-Gomez, JC; Rosario, O; Torres-Nunez, Y

abstract

  • We introduce the strong alliance polynomial of a graph. We obtain some properties of the strong alliance polynomial of a graph 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.

authors

publication date

  • January 1, 2016

published in

start page

  • 115

end page

  • 123

volume

  • 37

issue

  • 2