Results 11 to 20 of about 2,177,028 (229)
The number of P-vertices in a matrix with maximum nullity [PDF]
Linear Algebra and its Applications, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernandes, Rosário +1 more
core +9 more sources
Maximum generic nullity of a graph [PDF]
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hogben, Leslie, Shader, Bryan
openaire +3 more sources
A note on minimum rank and maximum nullity of sign patterns [PDF]
The Electronic Journal of Linear Algebra, 2011 The minimum rank of a sign pattern matrix is defined to be the smallest possible rank over all real matrices having the given sign pattern. The maximum nullity of a sign pattern is the largest possible nullity over the same set of matrices, and is equal to the number of columns minus the minimum rank of the sign pattern.
Hogben, Leslie
openaire +4 more sources
Positive semidefinite maximum nullity and zero forcing number [PDF]
The Electronic Journal of Linear Algebra, 2012 The zero forcing number Z(G) is used to study the minimum rank/maximum nullity of the family of symmetric matrices described by a simple, undirected graph G. The positive semidef- inite zero forcing number is a variant of the (standard) zero forcing number, which uses the same definition except with a different color-change rule.
Peters, Travis
openaire +3 more sources
Minimum rank, maximum nullity, and zero forcing number of simple digraphs [PDF]
The Electronic Journal of Linear Algebra, 2013 A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number is an upper bound for maximum nullity.
Berliner, Adam +5 more
openaire +4 more sources
Signed graphs with maximum nullity two
Linear Algebra and its Applications, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marina Arav +2 more
openaire +5 more sources
Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph [PDF]
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edholm, Christina +4 more
openaire +4 more sources
Maximum nullity of outerplanar graphs and the path cover number
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sinkovic, J.H.
openaire +4 more sources
Minimum rank, maximum nullity and zero forcing number for selected graph families [PDF]
Involve, a Journal of Mathematics, 2010 The minimum rank of a simple graph G is dened to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i 6 j) is nonzero whenever fi;jg is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices, and the sum of maximum nullity and minimum rank is the order of the graph.
Almodovar, Edgard +6 more
openaire +5 more sources
Zero forcing number, maximum nullity, and path cover number of subdivided graphs [PDF]
The Electronic Journal of Linear Algebra, 2012 The zero forcing number, maximum nullity and path cover number of a (simple, undirected) graph are parameters that are important in the study of minimum rank problems. We investigate the effects on these graph parameters when an edge is subdivided to obtain a so-called edge subdivision graph. An open question raised by Barrett et al. is answered in the
Catral, Minerva +6 more
openaire +5 more sources