21 citations · 47 across the 15 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016★ 21 cited
Connectivity in Hypergraphs
Megan Dewar, David Pike, John Proos
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by…
math.CO2016
Brushing Number and Zero-Forcing Number of Graphs and their Line Graphs
Aras Erzurumluoglu, David Pike, Karen Meagher
In this paper we compare the brushing number of a graph with the zero-forcing number of its line graph. We prove that the zero-forcing number of the line graph is an upper bound fo…