Skew-rank of an oriented graph with edge-disjoint cycles
From MaRDI portal
Publication:2805696
Recommendations
Cites work
- 3-regular digraphs with optimum skew energy
- 4-regular oriented graphs with optimum skew energy
- Bicyclic oriented graphs with skew-rank 2 or 4
- Minimal skew energy of oriented unicyclic graphs with a perfect matching
- Minimal skew energy of oriented unicyclic graphs with fixed diameter
- On the skew energy of orientations of hypercubes
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube
- Skew-adjacency matrices of graphs
- Some inequalities on the skew-spectral radii of oriented graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- The skew energy of a digraph
Cited in
(12)- 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
- Relationship between the rank and the matching number of a graph
- The skew-rank of oriented graphs
- 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-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Bicyclic oriented graphs with skew-rank 6
- The rank of a signed graph in terms of the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Bicyclic oriented graphs with skew-rank 2 or 4
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
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)