1 citations · 2 across the 4 of their papers we have counts for
6 papers · 1 filter
Conjecture of TxGraffiti: Independence, domination, and matchings
Yair Caro, Randy Davila, Michael Henning +1
TxGraffiti is an automated conjecturing program that produces graph theoretic conjectures in the form of conjectured inequalities. This program written and maintained by the second…
New results relating independence and matchings
Yair Caro, Randy Davila, Ryan Pepper
In this paper we study relationships between the \emph{matching number}, written , and the \emph{independence number}, written . Our first main result is to show \[ α(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…
Bounds on the connected forcing number of a graph
Randy Davila, Michael Henning, Colton Magnant +1
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph.…
Degree Sequence Index Strategy
Yair Caro, Ryan Pepper
We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration…