Skew-rank of an oriented graph in terms of matching number
DOI10.1016/J.LAA.2016.01.036zbMATH Open1331.05181OpenAlexW2258430117MaRDI QIDQ5962847FDOQ5962847
Xiaobin Ma, Dein Wong, Fenglei Tian
Publication date: 24 February 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.01.036
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- The skew energy of a digraph
- 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
- 3-regular digraphs with optimum skew energy
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- On the skew spectra of Cartesian products of graphs
- 4-regular oriented graphs with optimum skew energy
- 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
- On the skew energy of orientations of hypercubes
- Title not available (Why is that?)
Cited In (42)
- Energy, matching number and odd cycles of graphs
- Relation between the trace norm of an oriented graph and its rank
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- 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
- The rank of a complex unit gain graph in terms of the matching number
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- Relation between the \(H\)-rank of a mixed graph and the rank 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
- Adjacency rank and independence number of a signed 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
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- 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
- The gap between the rank of a complex unit gain graph and its underlying graph
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Nullity of a graph in terms of path cover number
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- 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
- On the inertia index of a mixed graph in terms of the matching number
- The rank of a signed graph in terms of the rank of its underlying graph
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- Relation between the skew energy of an oriented graph and its matching number
- 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
- Characterization of oriented graphs of rank 2
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- The relation between the H-rank of a mixed graph and the independence number of its underlying graph
- Relation between the rank of a signed graph and the rank of its underlying graph
- The \(\varepsilon\)-spectral radius of trees with perfect matchings
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- An improved lower bound for the nullity of a graph in terms of matching number
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Spectral norm of oriented graphs
- On the characterization of digraphs with given rank
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)