Shaun Fallat
Browse by
Office: CW 307.2
Email: Shaun.Fallat@uregina.ca
Phone: 3065854107
Website:
http://uregina.ca/~sfallat/
Current classes
Math 223 (Introduction to Abstract Algebra), Stat 252 (Statistical Inference)
Research interests
Matrix theory, discrete mathematics, graph theory, combinatorial matrix analysis
Recent Submissions

The enhanced principal rank characteristic sequence for skewsymmetric matrices
(Elsevier, 20150815)The enhanced principal rank characteristic sequence (eprsequence) was originally defined for an n ×n real symmetric matrix or an n ×n Hermitian matrix. Such a sequence is defined to be l1l2···ln where lk is A,S, or N ... 
On the complexity of the positive semidefinite zero forcing number
(Elsevier, 2015)The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a nontraditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation ... 
Parameters Related to TreeWidth, Zero Forcing, and Maximum Nullity of a Graph
(Wiley Periodicals, Inc., 2013)Treewidth, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the ... 
On the relationship between zero forcing number and certain graph coverings
(2014)The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced ... 
The principal rank characteristic sequence over various fields
(Elsevier, 2014)Given an nbyn matrix, its principal rank characteristic sequence is a sequence of length n + 1 of 0s and 1s where, for k = 0; 1,..., n, a 1 in the kth position indicates the existence of a principal submatrix of rank ... 
The enhanced principal rank characteristic sequence
(Elsevier, 2015)The enhanced principal rank characteristic sequence (eprsequence) of a symmetric n ×n matrix is a sequence from A,S, or N according as all, some, or none of its principal minors of order k are nonzero. Such sequences give ... 
On the null space struture associted with trees and cycles
(The Charles Babbage Research Centre, 201302)In this work, we study the structure of the null spaces of matrices associated with graphs. Our primary tool is utilizing Schur complements based on certain collections of independent vertices. This idea is applied in ... 
Colin de Verdiere parameters of chordal graphs
(International Linear Algebra Society, 201301)The Colin de Verdi`ere parameters mu and nu are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal ... 
Minimum number of distinct eigenvalues of graphs
(International Linear Algebra Society, 201309)The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to ... 
Note on NordhausGaddum problems for Colin de Verdiere type parameters
(Public Knowledge Network, 2013)We establish the bounds 4 on the Nordhaus Gaddum sum upper bound multipliers for all graphs G, in connections with certain Colin de Verdi ere type graph parameters. The NordhausGaddum sum lower bound is conjectured ... 
The maximum nullity of a complete edge subdivision graph is equal to it zero forcing number
(International Linear Algebra Society, 201406)Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic Journal of Linear Algebra, 18:530–563, 2009.], whether the maximum nullity is equal to the zero forcing number for all ...