Skew-rank of an oriented graph with edge-disjoint cycles

DOI10.1080/03081087.2015.1077776zbMath1338.05098OpenAlexW1848621898MaRDI QIDQ2805696

Fenglei Tian, Li Chen

Publication date: 12 May 2016

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

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

zbMATH Keywords

oriented graphsskew-adjacency matrixskew-rank

Mathematics Subject Classification ID

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

Related Items

The rank of a signed graph in terms of the rank of its underlying graph, The rank of a complex unit gain graph in terms of the rank of its underlying graph, Bounds for the rank of a complex unit gain graph in terms of its maximum degree, Relationship between the rank and the matching number of a graph, Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph

Cites Work

• Bicyclic oriented graphs with skew-rank 2 or 4
• Some inequalities on the skew-spectral radii of oriented graphs
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• Skew-adjacency matrices of graphs
• On the skew energy of orientations of hypercubes
• 3-regular digraphs with optimum skew energy
• Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
• Minimal skew energy of oriented unicyclic graphs with fixed diameter
• The skew energy of a digraph
• Minimal skew energy of oriented unicyclic graphs with a perfect matching
• 4-regular oriented graphs with optimum skew energy
• Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube