2 citations · 3 across the 4 of their papers we have counts for
3 papers · 1 filter
Constructions of cospectral graphs with different zero forcing numbers
Aida Abiad, Boris Brimkov, Jane Breen +3
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show t…
On digraphs with polygonal restricted numerical range
Thomas R. Cameron, H. Tracy Hall, Ben Small +1
In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In…
On the Linear Ordering Problem and the Rankability of Data
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review…