Skew-rank of an oriented graph in terms of matching number
From MaRDI portal
Publication:5962847
Recommendations
Cites work
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- 3-regular digraphs with optimum skew energy
- 4-regular oriented graphs with optimum skew energy
- Bicyclic digraphs with extremal skew energy
- Bicyclic oriented graphs with skew-rank 2 or 4
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- On the skew energy of orientations of hypercubes
- On the skew spectra of Cartesian products of graphs
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- Skew spectra of oriented bipartite graphs
- Skew spectra of oriented graphs
- Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube
- Skew-adjacency matrices of graphs
- Some inequalities on the skew-spectral radii of oriented graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- The skew energy of a digraph
- The skew-rank of oriented graphs
Cited in
(45)- The \(\varepsilon\)-spectral radius of trees with perfect matchings
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Skew-rank of an oriented graph and independence number of its underlying graph
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- Adjacency rank and independence number of a signed graph
- Relationship between the rank and the matching number of a graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- The gap between the rank of a complex unit gain graph and its underlying graph
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- On the inertia index of a mixed graph in terms of the matching number
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- The skew-rank of oriented graphs
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Proof of a conjecture on the nullity of a graph
- Energy, matching number and odd cycles of graphs
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Complex unit gain graphs of rank 2
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Spectral norm of oriented graphs
- Relation between the trace norm of an oriented graph and its rank
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- 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
- The rank of a complex unit gain graph in terms of the matching number
- Nullity of a graph in terms of path cover number
- Relation between the rank of a signed graph and the rank of its underlying graph
- Characterization of oriented graphs of rank 2
- Bicyclic oriented graphs with skew-rank 6
- An improved lower bound for the nullity of a graph in terms of matching number
- Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
- On the rank of a real skew symmetric matrix described by an oriented graph
- The rank of a signed graph in terms of the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- On the characterization of digraphs with given rank
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Relation between the skew energy of an oriented graph and its matching number
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- Bicyclic oriented graphs with skew-rank 2 or 4
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
This page was built for publication: Skew-rank of an oriented graph in terms of matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962847)