Relation between the trace norm of an oriented graph and its rank
From MaRDI portal
Publication:6168554
DOI10.1016/J.LAA.2023.06.023zbMATH Open1519.05166OpenAlexW4382404538MaRDI QIDQ6168554FDOQ6168554
Authors: Qi Zhou, Feng Xu, Yuanshuai Zhang, Dein Wong
Publication date: 9 August 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2023.06.023
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Matrix Analysis
- Lower bounds of Nikiforov's energy over digraphs
- Graph energy
- Energy of digraphs
- Title not available (Why is that?)
- Spectra of graphs
- The energy of graphs and matrices
- A characterization of long graphs of arbitrary rank
- A characterization of graphs with rank 5
- A characterization of graphs with rank 4
- Extremal values of the trace norm over oriented trees
- Matrix theory. Basic results and techniques
- Graph energy change due to edge deletion
- The skew-rank of oriented graphs
- On the nullity of graphs
- Mixed graphs with \(H\)-rank 3
- 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
- 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
- The rank of a signed graph in terms of the rank of its underlying graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Lower bounds of graph energy in terms of matching number
- A lower bound for graph energy
Cited In (2)
This page was built for publication: Relation between the trace norm of an oriented graph and its rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168554)