Show simple item record

dc.contributor.authorKerzner, Ethan
dc.contributor.authorTucker, Sarah
dc.descriptionAdvisor: L.M. DeAlbaen_US
dc.description.abstractEvery 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.sponsorshipDrake University, Department of mathematics and Computer Scienceen_US
dc.relation.ispartofseriesDUCURS 2010;43
dc.subjectGraph theory--Ratings and rankingsen_US
dc.subjectComplete graphs--Rating and rankingsen_US
dc.titleThe Minimum Skew Rank of Simple Graphs to Strict Powersen_US

Files in this item


This item appears in the following Collection(s)

    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