Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Taklimi, Fatemeh Alinaghipour"'
For any simple graph $G$ on $n$ vertices, the (positive semi-definite) minimum rank of $G$ is defined to be the smallest possible rank among all (positive semi-definite) real symmetric $n\times n$ matrices whose entry in position $(i,j)$, for $i\neq
Externí odkaz:
http://arxiv.org/abs/1311.7672
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 paths in the graph, while the p
Externí odkaz:
http://arxiv.org/abs/1311.7064
Publikováno v:
Special Matrices, Vol 2, Iss 1 (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 paths in the graph that cover a
Externí odkaz:
https://doaj.org/article/e215e85f2aff40729359f57a798d5f70
