2 citations · 3 across the 4 of their papers we have counts for
7 papers
On the Laplacian spread of digraphs
Wayne Barrett, Thomas R. Cameron, Emily Evans +2
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values f…
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…
Diameter Polytopes of Feasible Binary Programs
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
Feasible binary programs often have multiple optimal solutions, which is of interest in applications as they allow the user to choose between alternative optima without deteriorati…
On the Graph Laplacian and the Rankability of Data
Thomas R. Cameron, Amy N. Langville, Heather C. Smith
Recently, Anderson et al. (2019) proposed the concept of rankability, which refers to a dataset's inherent ability to produce a meaningful ranking of its items. In the same paper,…
On the application of Laguerre's method to the polynomial eigenvalue problem
Thomas R. Cameron, Nikolas I. Steckley
The polynomial eigenvalue problem arises in many applications and has received a great deal of attention over the last decade. The use of root-finding methods to solve the polynomi…