View Proposal #211
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 211 |
|---|---|
| First Name | Rana |
| Last Name | Mikkelson |
| Institution | Iowa State University |
| Speaker Category | graduate student |
| Title of Talk | An Introduction to Minimum Rank of a Graph |
| Abstract | Given a graph, we can associate a set of matrices therewith: the set of all symmetric matrices A over R where aij = 0 ? G has an edge between vertex i and j . We define the minimum rank of a graph is then the minimum among the ranks of all the matrices in this set. There is no one easy formula for computing this value given any graph, but for certain types graphs we can find the minimum rank exactly, and for others we can at least determine a few bounds. This talk introduces the topic and begins to explore the known results. |
| Subject area(s) | |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | |
| Bringing a laptop? | |
| Overhead Needed? | |
| Software requests | |
| Special Needs | |
| Date Submitted | 4/4/2007 |
| Year | 2007 |