Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
From MaRDI portal
Publication:5023803
DOI10.2298/FIL1804303LzbMath1499.05378arXiv1612.05043OpenAlexW2962871575WikidataQ128960902 ScholiaQ128960902MaRDI QIDQ5023803
Yong Lu, Qiannan Zhou, Li-Gong Wang
Publication date: 24 January 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05043
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Relation between the inertia indices of a complex unit gain graph and those of its underlying graph ⋮ The rank of a complex unit gain graph in terms of the rank of its underlying graph ⋮ On the difference between the skew-rank of an oriented graph and the rank of its underlying graph ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
Cites Work
- Unnamed Item
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Bicyclic oriented graphs with skew-rank 2 or 4
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- On the nullity of a graph with cut-points
- Bicyclic oriented graphs with skew-rank 6
- Spektren endlicher Grafen
- The rank of a graph after vertex addition
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Skew-rank of an oriented graph with edge-disjoint cycles
- On the nullity of graphs
- The skew-rank of oriented graphs
- More on the minimum skew-rank of 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
- The extremal graphs with respect to their nullity
This page was built for publication: Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph