View Proposal #202

If this proposal belongs to you, you are authorized to update it. Use the menu on the right.

ID202
First NameLuz
Last NameDe Alba Guerra
InstitutionDrake University
Speaker Categoryfaculty
Title of TalkMinimum Rank of Powers of Some Special Graphs
AbstractFor an n x n symmetric matrix A the graph of A, G(A) =(V, E) is a simple undirected graph with vertex set {1, 2, ..., n }, where {i, j } is in E, if and only if a_{ij} is not 0. For a graph G, with vertex set V = {1, 2, ..., n }, and edge set E, the r-th power of G is the graph G^r = (V, F), where {u, v } is in F if and only if there is a walk of length r from u to v. The minimum rank of a graph G is mr(G) = min{ rank(A) : A = A^T, and G(A) = G }. In this talk we determine the minimum rank of certain powers of two special families of graphs: paths and trees in general. We will also present a onjecture on the minimum rank of powers of cycles.
Subject area(s)
Suitable for undergraduates?Yes
Day Preference
Computer Needed?
Bringing a laptop?
Overhead Needed?
Software requests
Special Needs
Date Submitted4/3/2007
Year2007