Results 11 to 20 of about 2,050,476 (233)
Maximum generic nullity of a graph [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hogben, Leslie, Shader, Bryan
openaire +3 more sources
Change of nullity of a graph under two operations [PDF]
Two adjacent or non-adjacent vertices of a graph G are said to be identified, if they are combined to form one vertex whose neighbor is the union of their neighborhoods (ignoring any loops or multiple edges formed).
Gohdar H. Mohiaddin, Khidir R. Sharaf
doaj +2 more sources
On the nullity number of graphs [PDF]
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60--67] that $\eta \le n - D$, where $\eta$, n and D denote the nullity number, the order ...
Mustapha Aouchiche, Pierre Hansen
doaj +2 more sources
Minimum rank, maximum nullity and zero forcing number for selected graph families [PDF]
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
Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
It is known that the zero forcing number of a graph is an upper bound for the maximum nullity of the graph (see [AIM Minimum Rank - Special Graphs Work Group (F. Barioli, W. Barrett, S. Butler, S. Cioab$\breve{\text{a}}$, D. Cvetkovi$\acute{\text{c}}$, S. Fallat, C. Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I.
Young, Derek
openaire +6 more sources
A note on minimum rank and maximum nullity of sign patterns [PDF]
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
Minimum rank, maximum nullity, and zero forcing number of simple digraphs [PDF]
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
Positive semidefinite maximum nullity and zero forcing number [PDF]
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
Tree Cover Number and Maximum Semidefinite Nullity of Some Graph Classes
Let $G$ be a graph with a vertex set $V$ and an edge set $E$ consisting of unordered pairs of vertices. The tree cover number of $G$, denoted $\tau(G)$, is the minimum number of vertex disjoint simple trees occurring as induced subgraphs of $G$ that cover all the vertices of $G$.
Rachel Domagalski, Sivaram Narayan
openaire +4 more sources
Maximum nullity of outerplanar graphs and the path cover number [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sinkovic, J.H., Sinkovic, John
openaire +4 more sources

