A note on the minimum skew rank of a graph

DOI10.2306/SCIENCEASIA1513-1874.2014.40.313MaRDI QIDQ6233709zbMATH OpenFDO

Authors Yanna Wang, Bo Zhou

Publication date 15 June 2012

Full work available at URL https://doi.org/10.2306/SCIENCEASIA1513-1874.2014.40.313

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Abstract: The minimum skew rank $m{r}^{-}(mathbbF,G)$ of a graph $G$ over a field $mathbbF$ is the smallest possible rank among all skew symmetric matrices over $mathbbF$, whose ($i$,$j$)-entry (for $ieqj$) is nonzero whenever $ij$ is an edge in $G$ and is zero otherwise. We give some new properties of the minimum skew rank of a graph, including a characterization of the graphs $G$ with cut vertices over the infinite field $mathbbF$ such that $m{r}^{-}(mathbbF,G)=4$, determination of the minimum skew rank of $k$-paths over a field $mathbbF$, and an extending of an existing result to show that $m{r}^{-}(mathbbF,G)=2match(G)=M{R}^{-}(mathbbF,G)$ for a connected graph $G$ with no even cycles and a field $mathbbF$, where $match(G)$ is the matching number of $G$, and $M{R}^{-}(mathbbF,G)$ is the largest possible rank among all skew symmetric matrices over $mathbbF$.

This page was built for publication: A note on the minimum skew rank of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233709)