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

DOI10.1007/S10255-024-1103-XzbMath1530.05121MaRDI QIDQ6178518

Yi Wang, Bo-Jun Yuan, Jia-min Zhu

Publication date: 16 January 2024

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

zbMATH Keywords

rankcyclomatic numberskew-rank

Mathematics Subject Classification ID

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

Cites Work

• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• The rank of a signed graph in terms of the rank of its underlying graph
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Skew spectra of oriented graphs
• 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
• 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
• Relation between the skew-rank of an oriented graph and the rank 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