On the rank of a real skew symmetric matrix described by an oriented graph

DOI10.1080/03081087.2016.1201082zbMath1387.05149OpenAlexW2464150580MaRDI QIDQ4603668

Shi-Cai Gong

Publication date: 19 February 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2016.1201082

zbMATH Keywords

rankoriented graphskew symmetric matrixminimum skew rankskew adjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph ⋮ On bipartite graphs having minimum fourth adjacency coefficient

Cites Work

• Unnamed Item
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• Skew-adjacency matrices of graphs
• Characteristic polynomials of skew-adjacency matrices of oriented graphs
• Minimum rank of skew-symmetric matrices described by a graph
• Pólya's permanent problem
• Graphical condensation for enumerating perfect matchings
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• Permanents, Pfaffian orientations, and even directed circuits
• The skew energy of a digraph
• Skew spectra of oriented graphs
• Classes of graphs with minimum skew rank 4
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• On graphs of minimum skew rank 4
• The Factorization of Linear Graphs

This page was built for publication: On the rank of a real skew symmetric matrix described by an oriented graph