J. A. Rodŕıguez

most citedThe (a,b,s,t)-diameter of graphs: a particular case of conditional diameter

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

collaborators

3 papers

math.CO2006★ 1 cited

Offensive alliances in cubic graphs

J. A. Rodriguez, J. M. Sigarreta

An offensive alliance in a graph $Γ = (V, E)$ is a set of vertices $S \subset V$ where for every vertex $v$ in its boundary it holds that the majority of vertices in $v$ 's closed neigh…

math.CO2006★ 2 cited

The (a,b,s,t)-diameter of graphs: a particular case of conditional diameter

J. A. Rodriguez

The conditional diameter of a connected graph $Γ = (V, E)$ is defined as follows: given a property $P$ of a pair $(Γ_{1}, Γ_{2})$ of subgraphs of $Γ$ , the so-called \emph{condition…

math.CO2006

On the global offensive alliance number of a graph

J. M. Sigarreta, J. A. Rodriguez

An offensive alliance in a graph $Γ = (V, E)$ is a set of vertices $S \subset V$ where for every vertex $v$ in its boundary it holds that the majority of vertices in $v$ 's closed neigh…