On the difference between the skew-rank of an oriented graph and the rank of its underlying graph

DOI10.1007/S10255-024-1103-XzbMATH Open1530.05121MaRDI QIDQ6178518FDOQ6178518

Authors: Jia-Min Zhu, Bo-Jun Yuan, Yi Wang 

Publication date: 16 January 2024

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

rankskew-rankcyclomatic number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Skew spectra of oriented graphs
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• The skew-rank of oriented graphs
• 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
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• The rank of a signed graph in terms of the rank of its underlying graph
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph

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)