Results on minimum skew rank of matrices described by a graph

Thumbnail Image
Date
2009-01-01
Authors
Deloss, Laura
Major Professor
Advisor
Leslie Hogben
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Mathematics
Welcome to the exciting world of mathematics at Iowa State University. From cracking codes to modeling the spread of diseases, our program offers something for everyone. With a wide range of courses and research opportunities, you will have the chance to delve deep into the world of mathematics and discover your own unique talents and interests. Whether you dream of working for a top tech company, teaching at a prestigious university, or pursuing cutting-edge research, join us and discover the limitless potential of mathematics at Iowa State University!
Journal Issue
Is Version Of
Versions
Series
Department
Abstract

The minimum skew rank of a finite, simple, undirected graph G over a field F of characteristic not equal to 2 is defined to be the minimum possible rank of all skew-symmetric matrices over F whose i,j-entry is nonzero if and only if there exists an edge {i,j} in the graph G. The problem of determining the minimum skew rank of a graph arose after extensive study of the minimum (symmetric) rank problem.

This thesis gives a background of techniques used to find minimum skew rank first developed by the IMA-ISU research group on minimum rank proves cut-vertex reduction of a graph realized by a skew-symmetric matrix, and proves there is a bound for minimum skew rank created by the skew zero forcing number. The result of cut-vertex reduction is used to calculate the minimum skew ranks of families of coronas, and the minimum skew ranks of multiple other families of graphs are also computed.

Comments
Description
Keywords
Citation
Source
Subject Categories
Copyright
Thu Jan 01 00:00:00 UTC 2009