O. Rosario

activity

20152026

most citedComputing the strong alliance polynomial of a graph

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

collaborators

Showing 2015Show all

2 papers · 1 filter

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.MG2015★ 1 cited

Gromov hyperbolicity of minor graphs

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

If $X$ is a geodesic metric space and $x_{1}, x_{2}, x_{3} \in X$ , a geodesic triangle $T = {x_{1}, x_{2}, x_{3}}$ is the union of the three geodesics $[x_{1} x_{2}]$ , $[x_{2} x_{3}]$ and $[x_{3} x_{1}]$ in $X$ .…