Skew-rank of an oriented graph with edge-disjoint cycles
From MaRDI portal
Publication:2805696
DOI10.1080/03081087.2015.1077776zbMATH Open1338.05098OpenAlexW1848621898MaRDI QIDQ2805696FDOQ2805696
Authors: Fenglei Tian 
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)
Cites Work
- The skew energy of a digraph
- Some inequalities on the skew-spectral radii of oriented graphs
- Skew-adjacency matrices of graphs
- 3-regular digraphs with optimum skew energy
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- 4-regular oriented graphs with optimum skew energy
- Bicyclic oriented graphs with skew-rank 2 or 4
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
- On the skew energy of orientations of hypercubes
- Minimal skew energy of oriented unicyclic graphs with fixed diameter
- Minimal skew energy of oriented unicyclic graphs with a perfect matching
Cited In (6)
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- The skew-rank of oriented graphs
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- The rank of a signed graph in terms of the rank of its underlying graph
- Relationship between the rank and the matching number of a graph
This page was built for publication: Skew-rank of an oriented graph with edge-disjoint cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805696)
