Relation between the skew-rank of an oriented graph and the rank of its underlying graph

DOI10.1016/J.EJC.2015.12.005MaRDI QIDQ5964257zbMATH OpenOpenAlexFDO

Authors Dein Wong, Xiaobin Ma, Fenglei Tian

Publication date 29 February 2016

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2015.12.005

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
• On the relationship 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
• Skew-rank of an oriented graph with edge-disjoint cycles
• The skew-rank of some oriented graphs

Cites work

• 3-regular digraphs with optimum skew energy
• 4-regular oriented graphs with optimum skew energies
• 4-regular oriented graphs with optimum skew energy
• A characterization of graphs with rank 4
• A characterization of graphs with rank 5
• Bicyclic digraphs with extremal skew energy
• Bicyclic oriented graphs with skew-rank 2 or 4
• Characteristic polynomials of skew-adjacency matrices of oriented graphs
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• Minimal skew energy of oriented unicyclic graphs with a perfect matching
• Minimal skew energy of oriented unicyclic graphs with fixed diameter
• On the nullity of a graph with cut-points
• On the nullity of 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 rank of a graph after vertex addition
• The skew energy of a digraph
• The skew-rank of oriented graphs

Cited in

(51)

• An upper bound of the nullity of a graph in terms of order and maximum degree
• The rank of a signed graph in terms of the rank of its underlying graph
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• Relation between the skew energy of an oriented graph and its matching number
• Relationship between the rank and the matching number of a graph
• Complex unit gain graphs of rank 2
• On the characterization of digraphs with given rank
• Relations between the inertia indices of a mixed graph and those of its underlying graph
• On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected 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
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• Characterization of oriented graphs of rank 2
• On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
• Adjacency rank and independence number of a signed 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
• Upper bound of skew energy of an oriented graph in terms of its skew rank
• Spectral norm of oriented graphs
• 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 relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Nullity of a graph in terms of path cover number
• Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
• On the balanced domination of graphs
• The skew-rank of oriented graphs
• Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
• On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
• Relation between the inertia indices of a complex unit gain graph and those 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
• An improved lower bound for the nullity of a graph in terms of matching number
• Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph
• 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 skew-rank of some oriented graphs
• Skew-rank of an oriented graph in terms of matching number
• Inertia indices of a complex unit gain graph in terms of matching number
• Proof of a conjecture on the nullity of a graph
• On the skew spectral moments of trees and unicyclic graphs
• Relation between the trace norm of an oriented graph and its rank
• On the difference between the skew-rank of an oriented graph and the rank of its underlying graph
• Line graphs of trees with the largest eigenvalue multiplicity
• Relations between the skew spectrum of an oriented graph and the spectrum of an associated signed graph
• Bounds of nullity for complex unit gain graphs
• Characterization of graphs with rank 2v(G) - 2(G) - 2c(G) + 1
• A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1
• The rank of a complex unit gain graph in terms of the rank and the independence number 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
• Halving the size of skew-symmetric eigenvalue problems via the polar decomposition
• Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank

This page was built for publication: Relation 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 Q5964257)