A note on the minimum skew rank of powers of paths
Combinatorics
2011-07-14 v1
Abstract
The real minimum skew rank of a simple graph G is the smallest possible rank among all real skew symmetric matrices, whose (i,j)-entry (for i not equal to j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. In this paper we study the problem of real minimum skew rank of powers and strict powers of paths.
Keywords
Cite
@article{arxiv.1107.2450,
title = {A note on the minimum skew rank of powers of paths},
author = {Luz M. DeAlba and Ethan Kerzner and Sarah Tucker},
journal= {arXiv preprint arXiv:1107.2450},
year = {2011}
}