Minimun Rank Matrices with Prescribed Graph
| Autor: | Ping-hong Wei, 魏平洪 |
|---|---|
| Rok vydání: | 2000 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 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 $m(G)$: Theorem: Suppose $y$ is a vertex of $G$ with degree 1 and $x$ is the neighbor of $y$. Then $m(G)=m(G_y)+1$ iff $m(G_y)\leq m(G_x)+1$. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|