On the characterization of digraphs with given rank

DOI10.1016/J.LAA.2019.11.008MaRDI QIDQ2174415zbMATH OpenOpenAlexFDO

Authors N. Agudelo, Juan Monsalve, Juan Rada

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

adjacency matrixdigraphranksplitting vertexvertex-multiplication

Mathematics Subject Classification ID

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

Recommendations

• Characterization of topologies of some digraphs
• On good characterizations for digraphs
• Characterizations of two classes of digraphs
• On the principal permanent rank characteristic sequences of graphs and digraphs
• On ranking and unranking labeled digraphs
• A characterization of graphs with rank 4
• An algorithmic characterization of total digraphs
• A characterization problem on underlying graphs of line digraphs
• scientific article; zbMATH DE number 4156491
• scientific article; zbMATH DE number 4200231

Cites work

• A characterization of graphs with rank 4
• A characterization of graphs with rank 5
• Characterization of oriented graphs of rank 2
• Directed strongly regular graphs with rank 5
• scientific article; zbMATH DE number 1983913 (Why is no real title available?)
• Mixed graphs with \(H\)-rank 3
• On the nullity of bipartite graphs
• On the nullity of graphs
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• Oriented bipartite graphs with minimal trace norm
• Rank of adjacency matrices of directed (strongly) regular graphs
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Skew-rank of an oriented graph in terms of matching number
• The rank of a signed graph in terms of the rank of its underlying graph
• The skew-rank of oriented graphs
• The Triangle-Free Graphs with Rank 6

Cited in

(13)

• Birational equivalence of reduced graphs
• Characterization of oriented graphs of rank 2
• Lower bounds for the spectral norm of digraphs
• Digraph representation by its path matrix the particular case of the bipartite graphs
• Maximum Rank of Powers of a Matrix of a Given Pattern
• An application of the incidence matrix to digraphs.
• On ranking and unranking labeled digraphs
• scientific article; zbMATH DE number 2192167 (Why is no real title available?)
• The first three largest values of the spectral norm of oriented bicyclic graphs
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
• A characterization of graphs with rank 4
• Bounds for the trace norm of A_ matrix of digraphs
• A characterization of semitwin digraphs

This page was built for publication: On the characterization of digraphs with given rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174415)