On the characterization of digraphs with given rank

DOI10.1016/j.laa.2019.11.008zbMath1437.05084OpenAlexW2988516549MaRDI QIDQ2174415

Juan Rada, Juan Monsalve, Natalia Agudelo

Publication date: 21 April 2020

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.11.008

zbMATH Keywords

digraphadjacency matrixrankvertex-multiplicationsplitting vertex

Mathematics Subject Classification ID

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

Related Items (2)

Lower bounds for the spectral norm of digraphs ⋮ The first three largest values of the spectral norm of oriented bicyclic graphs

Cites Work

• Unnamed Item
• A characterization of graphs with rank 5
• Mixed graphs with \(H\)-rank 3
• A characterization of graphs with rank 4
• 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
• Characterization of oriented graphs of rank 2
• Directed strongly regular graphs with rank 5
• Rank of adjacency matrices of directed (strongly) regular graphs
• On the nullity of graphs
• 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
• The Triangle-Free Graphs with Rank 6
• On the nullity of bipartite 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: On the characterization of digraphs with given rank