A. Hansberg

activity

20122017

k

-independence number of a graph

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

collaborators

3 papers

math.CO2017★ 1 cited

Zero-sum $K_{m}$ over $Z$ and the story of $K_{4}$

Yair Caro, Adriana Hansberg, Amanda Montejano

We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over $Z$ , Graphs Combin. 32 (2016), 49--63]. For…

math.CO2015

Partial domination - the isolation number of a graph

Yair Caro, Adriana Hansberg

We prove the following result: If $G$ be a connected graph on $n \geq 6$ vertices, then there exists a set of vertices $D$ with $∣ D ∣ \leq \frac{n}{3}$ and such that $V(G) \setminus N…

math.CO2012★ 4 cited

New approach to the $k$ -independence number of a graph

Yair Caro, Adriana Hansberg

Let $G = (V, E)$ be a graph and $k \geq 0$ an integer. A $k$ -independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most…

Zero-sum Km​ over Z and the story of K4​

Partial domination - the isolation number of a graph

New approach to the k-independence number of a graph

Zero-sum $K_{m}$ over $Z$ and the story of $K_{4}$

New approach to the $k$ -independence number of a graph