The Minimum Rank of a Mountain
碩士 === 國立交通大學 === 應用數學系所 === 101 === Let G be a simple graph with vertex set V(G) = [n] = {1,2,..,n} and edge set E(G). The minimum rank m(G) of G is the minimum possible rank of an n by n symmetric matrix A whose i j-th entry is not zero if and only if ij is in E(G), where i,j are distinct. For m &...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/80891348994509548316 |