On the difference between the skew-rank of an oriented graph and the rank of its underlying graph
From MaRDI portal
Publication:6178518
Recommendations
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- The skew-rank of some oriented graphs
- The skew-rank of oriented graphs
Cites work
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew spectra 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 signed graph in terms of the rank of its underlying graph
- The skew-rank of oriented graphs
This page was built for publication: On the difference between the skew-rank of an oriented graph and the rank of its underlying graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178518)