View Proposal #288
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 288 |
|---|---|
| First Name | Travis |
| Last Name | Peters |
| Institution | Iowa State University |
| Speaker Category | graduate student |
| Title of Talk | Minimum rank, maximum nullity and zero forcing number for selected graph families |
| Abstract | The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. This talk discusses the graph families ciclos and estrellas. In particular, these families provide the examples showing that the maximum nullity of a graph and its dual may differ, and similarly for zero forcing number. |
| Subject area(s) | |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | Y |
| Bringing a laptop? | N |
| Overhead Needed? | N |
| Software requests | |
| Special Needs | |
| Date Submitted | 10/11/2010 |
| Year | 2010 |