Skew-rank of an oriented graph in terms of matching number

DOI10.1016/J.LAA.2016.01.036MaRDI QIDQ5962847zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

skew-adjacency matrixskew-rankoriented graphs

Mathematics Subject Classification ID

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)

Recommendations

• The skew-rank of oriented graphs
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Skew-rank of an oriented graph with edge-disjoint cycles
• The skew-rank of some oriented graphs
• Bicyclic oriented graphs with skew-rank 2 or 4

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

(47)

• Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
• Energy, matching number and odd cycles of graphs
• The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
• Relation between the trace norm of an oriented graph and its rank
• 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
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Proof of a conjecture on the nullity of a 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
• Adjacency rank and independence number of a signed graph
• 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
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• Bicyclic oriented graphs with skew-rank 2 or 4
• 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
• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
• The gap between the rank of a complex unit gain graph and its underlying graph
• Nullity of a graph in terms of path cover number
• 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
• Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
• The rank of a signed graph in terms of the rank of its underlying graph
• Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
• On the inertia index of a mixed graph in terms of the matching number
• Relation between the skew energy of an oriented graph and its matching number
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• 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
• On the rank of a real skew symmetric matrix described by an oriented graph
• Characterization of oriented graphs of rank 2
• 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 \(\varepsilon\)-spectral radius of trees with perfect matchings
• Bicyclic oriented graphs with skew-rank 6
• 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
• Spectral norm of oriented graphs
• Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
• 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)