Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Cameron, Thomas R."'
In 2018, a fort of a graph was introduced as a non-empty subset of vertices in which no vertex outside of the set has exactly one neighbor in the set. Since then, forts have been used to characterize zero forcing sets, model the zero forcing number a
Externí odkaz:
http://arxiv.org/abs/2404.05963
Autor:
Cameron, Thomas R., Hogben, Leslie, Kenter, Franklin H. J., Mojallal, Seyed Ahmad, Schuerger, Houston
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is introduced and hypergraph results on transversals and matchings are a
Externí odkaz:
http://arxiv.org/abs/2310.17904
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 for several families of digraphs. Then, we prove sharp upper bounds on
Externí odkaz:
http://arxiv.org/abs/2206.15410
Autor:
Abiad, Aida, Brimkov, Boris, Breen, Jane, Cameron, Thomas R., Gupta, Himanshu, Villagrán, Ralihe R.
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 that several NP-hard zero forcing numbers are not characterized by the
Externí odkaz:
http://arxiv.org/abs/2111.12343
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 particular, digraphs with a restricted numerical range of a single poi
Externí odkaz:
http://arxiv.org/abs/2106.00701
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 of the linear ordering problem (LOP) and then use it to analyze the ra
Externí odkaz:
http://arxiv.org/abs/2104.05816
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 deteriorating the objective function. In this article, we present the optimal dia
Externí odkaz:
http://arxiv.org/abs/2008.06844
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, they proposed a rankability measure that is based on a integer program
Externí odkaz:
http://arxiv.org/abs/1912.00275
Publikováno v:
In Linear Algebra and Its Applications 1 May 2023 664:126-146
Publikováno v:
In Linear Algebra and Its Applications 1 June 2022 642:285-310