The Minimum Skew Rank of Simple Graphs to Strict Powers

DSpace/Manakin Repository

Show simple item record Kerzner, Ethan Tucker, Sarah 2010-05-10T16:13:04Z 2010-05-10T16:13:04Z 2010-05-10T16:13:04Z
dc.description Advisor: L.M. DeAlba en_US
dc.description.abstract Every simple graph can be represented by an adjacency matrix. The minimum skew rank of a graph is the smallest possible rank of all skew-symmetric matrices whose non-zero entries correspond to edges of the graph. Extensive work has established methods for finding the minimum skew rank of simple graphs. The strict power of a graph, G(S) is generated by walks of exactly s steps on G. We examined the minimum skew rank of strict powers of paths using known results for n-partite complete graphs, forbidden subgraphs, algorithms for edge coverings and cut vertex reduction. We will present our method of using Wolfram Mathematica to generate the strict powers of graphs and discuss the patterns discovered in the minimum skew rank of such graphs. en_US
dc.description.sponsorship Drake University, Department of mathematics and Computer Science en_US
dc.language.iso en_US en_US
dc.relation.ispartofseries DUCURS 2010;43
dc.subject Graph theory--Ratings and rankings en_US
dc.subject Complete graphs--Rating and rankings en_US
dc.title The Minimum Skew Rank of Simple Graphs to Strict Powers en_US
dc.type Presentation en_US

Files in this item

This item appears in the following Collection(s)

  • DUCURS [196]
    Poster sessions and presentation from the Drake University Conference on Undergraduate Research in the Sciences held each April at Olmsted Center on the Drake campus.

Show simple item record

Search DSpace

Advanced Search


My Account