| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653372 | European Journal of Combinatorics | 2015 | 4 Pages |
Abstract
The star tree rank of a matrix A is the smallest k for which A is an entrywise minimum of k distance matrices of weighted trees without internal edges. The deficiency graph of A has an edge connecting (i,j) and (k,l) if and only if Aij+Akl
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yaroslav Shitov,