On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
From MaRDI portal
Publication:725520
DOI10.1016/J.LAA.2018.04.032zbMATH Open1392.05077OpenAlexW2803910663WikidataQ129807384 ScholiaQ129807384MaRDI QIDQ725520FDOQ725520
Authors: Wenjun Luo, Jing Huang, Shuchao Li 
Publication date: 1 August 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.04.032
Recommendations
- 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 the rank and dimension of cycle space of its underlying graph
- Skew-rank of an oriented graph and independence number of its underlying graph
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- The skew-rank of some oriented graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Skew spectra of oriented graphs
- Some inequalities on the skew-spectral radii of oriented graphs
- Skew-adjacency matrices of graphs
- Title not available (Why is that?)
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- A characterization of graphs with rank 5
- A characterization of graphs with rank 4
- On the nullity of a graph with cut-points
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Bicyclic oriented graphs with skew-rank 2 or 4
- Skew spectra of oriented bipartite graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube
- The skew-rank of oriented graphs
- Classes of graphs with minimum skew rank 4
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Minimum rank of skew-symmetric matrices described by a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- The rank of a graph after vertex addition
- On the rank of multicyclic graphs
- Classes of structurable algebras of skew-rank
- On the nullity of graphs
- Structurable algebras of skew-rank 1 over the affine plane
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- More on the minimum skew-rank of graphs
- Bicyclic oriented graphs with skew-rank 6
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- On graphs of minimum skew rank 4
- 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
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
Cited In (29)
- Relation between the trace norm of an oriented graph and its rank
- Proof of a conjecture on the nullity of a graph
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- The skew-rank of oriented graphs
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Complex unit gain graphs of rank 2
- On the difference between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Skew-rank of an oriented graph and independence number of its underlying graph
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- Relationship between the rank and the matching number of a graph
- Relations between the skew spectrum of an oriented graph and the spectrum of an associated signed graph
- Characterization of oriented graphs of rank 2
- Smith normal form and the generalized spectral characterization of oriented graphs
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Relation between the rank of a signed graph and the rank of its underlying graph
- The skew-rank of some oriented graphs
- An improved lower bound for the nullity of a graph in terms of matching number
- On the characterization of digraphs with given rank
- Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
Uses Software
This page was built for publication: On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725520)
