Digraphs and sign patterns that allow exactly one distinct eigenvalue
Start Date
2023 2:15 PM
Location
Alter Hall Poster Session 1 - 3rd floor
Abstract
A sign pattern is a matrix with entries in {+, -, 0}. A directed graph (digraph) ���� on n vertices consists of a vertex set V(����) = {1,2,...,n} and an arc set E(����) where (i,j) ϵ E(����) if and only if there is an arc from vertex i to vertex j. We introduce sign pattern matrices and their associated digraphs. We investigate the digraph structure of patterns that allow a certain number of distinct eigenvalues, in particular, those that allow exactly one distinct eigenvalue.
Digraphs and sign patterns that allow exactly one distinct eigenvalue
Alter Hall Poster Session 1 - 3rd floor
A sign pattern is a matrix with entries in {+, -, 0}. A directed graph (digraph) ���� on n vertices consists of a vertex set V(����) = {1,2,...,n} and an arc set E(����) where (i,j) ϵ E(����) if and only if there is an arc from vertex i to vertex j. We introduce sign pattern matrices and their associated digraphs. We investigate the digraph structure of patterns that allow a certain number of distinct eigenvalues, in particular, those that allow exactly one distinct eigenvalue.
