10 citations · 46 across the 64 of their papers we have counts for
6 papers · 1 filter
The effect of local majority on global majority in connected graphs
Yair Caro, Raphael Yuster
Let be an infinite family of connected graphs and let be a positive integer. We say that is for if for all $G \in {\mathcal G}…
Maximum oriented forcing number for complete graphs
Yair Caro, Ryan Pepper
The maximum oriented -forcing number of a simple graph , written $\MOF_k(G)$, is the maximum directed -forcing number among all orientations of . This invariant was rec…
Extremal -forcing sets in oriented graphs
Yair Caro, Randy Davila, Ryan Pepper
This article studies the \emph{-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed graphs and the -forcing number for simple g…
Zero-sum over and the story of
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 , Graphs Combin. 32 (2016), 49--63]. For…
Irregular independence and irregular domination
Peter Borg, Yair Caro, Kurt Fenech
If is an independent set of a graph such that the vertices in have different degrees, then we call an irregular independent set of . If is a dominating set o…
Equating two maximum degrees
Yair Caro, Josef Lauri, Christina Zarb
Given a graph , we would like to find (if it exists) the largest induced subgraph in which there are at least vertices realizing the maximum degree of . This problem…