summary:The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades. Along these lines various zero forcing parameters have been devised and utilized for bounding the maximum nullity. The maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing a variety of specific properties are analysed. Building upon earlier work, where connections to the minimum rank of line graphs were established, we verify analogous equations in the positive semidefinite cases and coincidences with the corresponding zero forcing numbers. Working beyond the case of trees, we study the...
The zero forcing number of a simple loopless undirected graph, being an upper bound on the path cove...
AbstractThe minimum rank of a simple graph G is defined to be the smallest possible rank over all sy...
The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way z...
summary:The maximum nullity over a collection of matrices associated with a graph has been attractin...
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in ...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic J...
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric ...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
AbstractThe zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set ...
The zero forcing number of a graph has been applied to communication complexity, electrical power gr...
AbstractThe zero forcing number of a graph is the minimum size of a zero forcing set. This parameter...
The maximum nullity of a simple graph $ G $ over a field $ \mathcal{F} $ is the maximum nullity over...
Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its ...
AbstractA graph describes the zero–nonzero pattern of a family of matrices, with the type of graph (...
The zero forcing number of a simple loopless undirected graph, being an upper bound on the path cove...
AbstractThe minimum rank of a simple graph G is defined to be the smallest possible rank over all sy...
The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way z...
summary:The maximum nullity over a collection of matrices associated with a graph has been attractin...
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in ...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic J...
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric ...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
AbstractThe zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set ...
The zero forcing number of a graph has been applied to communication complexity, electrical power gr...
AbstractThe zero forcing number of a graph is the minimum size of a zero forcing set. This parameter...
The maximum nullity of a simple graph $ G $ over a field $ \mathcal{F} $ is the maximum nullity over...
Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its ...
AbstractA graph describes the zero–nonzero pattern of a family of matrices, with the type of graph (...
The zero forcing number of a simple loopless undirected graph, being an upper bound on the path cove...
AbstractThe minimum rank of a simple graph G is defined to be the smallest possible rank over all sy...
The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way z...