The skew-rank of oriented graphs

DOI10.1360/012014-51MaRDI QIDQ5017999zbMATH OpenOpenAlexFDO

Authors Guihai Yu, Xueliang Li

Publication date 17 December 2021

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7230

zbMATH Keywords

oriented graphskew-adjacency matrixskew-rank

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Abstract: An oriented graph $G^{s}igma$ is a digraph without loops and multiple arcs, where $G$ is called the underlying graph of $G^{s}igma$. Let $S(G^{s}igma)$ denote the skew-adjacency matrix of $G^{s}igma$. The rank of the skew-adjacency matrix of $G^{s}igma$ is called the {it skew-rank} of $G^{s}igma$, denoted by $sr(G^{s}igma)$. The skew-adjacency matrix of an oriented graph is skew symmetric and the skew-rank is even. In this paper we consider the skew-rank of simple oriented graphs. Firstly we give some preliminary results about the skew-rank. Secondly we characterize the oriented graphs with skew-rank 2 and characterize the oriented graphs with pendant vertices which attain the skew-rank 4. As a consequence, we list the oriented unicyclic graphs, the oriented bicyclic graphs with pendant vertices which attain the skew-rank 4. Moreover, we determine the skew-rank of oriented unicyclic graphs of order $n$ with girth $k$ in terms of matching number. We investigate the minimum value of the skew-rank among oriented unicyclic graphs of order $n$ with girth $k$ and characterize oriented unicyclic graphs attaining the minimum value. In addition, we consider oriented unicyclic graphs whose skew-adjacency matrices are nonsingular.

Recommendations

• The skew-rank of some oriented graphs
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• Skew-rank of an oriented graph with edge-disjoint cycles
• Skew-rank of an oriented graph and independence number of its underlying graph
• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Skew-rank of an oriented graph in terms of matching number
• Skew spectra of oriented graphs
• Oriented graphs determined by their generalized skew spectrum
• Upper bound of skew energy of an oriented graph in terms of its skew rank

Cited in

(33)

• The rank of a signed graph in terms of the rank of its underlying graph
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• Relationship between the rank and the matching number of a graph
• Complex unit gain graphs of rank 2
• On the characterization of digraphs with given rank
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Characterization of oriented graphs of rank 2
• Adjacency rank and independence number of a signed graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Upper bound of skew energy of an oriented graph in terms of its skew rank
• Skew-rank of an oriented graph and independence number of its underlying graph
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• Skew-rank of an oriented graph with edge-disjoint cycles
• Bicyclic oriented graphs with skew-rank 2 or 4
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• On the rank of a real skew symmetric matrix described by an oriented graph
• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• More on the minimum skew-rank of graphs
• The skew-rank of some oriented graphs
• scientific article; zbMATH DE number 7071467 (Why is no real title available?)
• Skew-rank of an oriented graph in terms of matching number
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• On the skew spectral moments of trees and unicyclic graphs
• Relation between the trace norm of an oriented graph and its rank
• Skew-adjacency matrices of tournaments with bounded principal minors
• On the difference between the skew-rank of an oriented graph and the rank of its underlying graph
• Almost full rank matrices arising from transitive tournaments
• Bicyclic oriented graphs with skew-rank 6
• Hermitian skew Laplacian matrix of oriented graphs
• Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• Characterizations of signed and oriented graphs exhibiting a large multiplicity of one eigenvalue

This page was built for publication: The skew-rank of oriented graphs

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