Characterization of oriented graphs of rank 2

DOI10.1016/J.LAA.2019.05.021zbMath1419.05094OpenAlexW2946954808WikidataQ127768106 ScholiaQ127768106MaRDI QIDQ2272483

Yanyan Li

Publication date: 10 September 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2019.05.021

zbMATH Keywords

digraphsoriented graphsrank of graphs

Mathematics Subject Classification ID

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

Related Items (4)

A NOTE ON THE SINGULARITY OF ORIENTED GRAPHS ⋮ Relation between the inertia indices of a complex unit gain graph and those of its underlying graph ⋮ On the characterization of digraphs with given rank ⋮ SINGULARITY OF ORIENTED GRAPHS FROM SEVERAL CLASSES

Cites Work

• Extremal values of the trace norm over oriented trees
• A characterization of graphs with rank 5
• Mixed graphs with \(H\)-rank 3
• A characterization of graphs with rank 4
• Spectra of graphs
• 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
• A characterization of long graphs of arbitrary rank
• On the nullity of graphs
• Matrix Analysis
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Oriented bipartite graphs with minimal trace norm
• The skew-rank of oriented graphs
• Skew-rank of an oriented graph in terms of matching number
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph

This page was built for publication: Characterization of oriented graphs of rank 2