Yadira Torres-Nuñez

activity

20142020

most citedComputing the alliance polynomial of a graph

3 citations · 6 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2020

Distinguishing wheel graphs by the alliance polynomial

Walter Carballosa, Omar Rosario, José M. Sigarreta +1

Distinctive power of the alliance polynomial has been studied in previous works, for instance, it has been proved that the empty, path, cycle, complete, complete without one edge a…

math.CO2015★ 3 cited

Computing the strong alliance polynomial of a graph

Walter Carballosa, Juan Carlos Hernandez-Gomez, Omar Rosario +1

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(…

math.CO2015

Alliance polynomial of regular graphs

Walter Carballosa, José M. Rodríguez, José M. Sigarreta +1

The alliance polynomial of a graph $G$ with order $n$ and maximum degree $Δ$ is the polynomial $A (G; x) = \sum_{k = - Δ}^{Δ} A_{k} (G) x^{n + k}$ , where $A_{k} (G)$ is the number of exac…

math.CO2014★ 3 cited

Computing the alliance polynomial of a graph

Walter Carballosa, José M. Rodríguez, José M. Sigarreta +1

The alliance polynomial of a graph $Γ$ with order $n$ and maximum degree $δ_{1}$ is the polynomial $A (Γ; x) = \sum_{k = - δ_{1}}^{δ_{1}} A_{k} (Γ) x^{n + k}$ , where $A_{k} (Γ)$ is the number…