Search
Now showing items 1-3 of 3
The principal rank characteristic sequence over various fields
(Elsevier, 2014)
Given an n-by-n 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 (epr-sequence) 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 ...
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph
(Wiley Periodicals, Inc., 2013)
Tree-width, 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 ...