Minimun Rank Matrices with Prescribed Graph
碩士 === 國立交通大學 === 應用數學系 === 88 === Let $G$ be an undirected graph without loops or edges. For a vertex $x\in V(G)$, let $G_x$ denoted the subgraph induced on the vertex set $V(G)\in \{x\}$. We obtain the following back and Forth algorithm to compute the minimun rank...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27190511296498678712 |