The skew-rank of oriented graphs

@inproceedings{Li2014TheSO,
  title={The skew-rank of oriented graphs},
  author={Xueliang Li and Guihai Yu},
  year={2014}
}
An oriented graph G σ is a digraph without loops and multiple arcs, where G is called the underlying graph of G σ . Let S( G σ ) denote the skew-adjacency matrix of G σ . The rank of the skew-adjacency matrix of G σ is called the skew-rank of G σ , denoted by sr( G σ ). The skew-adjacency matrix of an oriented graph is skew symmetric and the skew-rank is even. We consider the skew-rank of simple oriented graphs. Firstly, we give some preliminary results about the skew-rank. Secondly, we… 

Figures from this paper

Skew-rank of an oriented graph in terms of matching number
Abstract An oriented graph G σ is a digraph without loops and multiple arcs, where G is called the underlying graph of G σ . Let S ( G σ ) denote the skew-adjacency matrix of G σ . The rank of S ( G
Upper bound of skew energy of an oriented graph in terms of its skew rank
Abstract Let G σ be an oriented graph with skew adjacency matrix S ( G σ ) . The skew energy E s ( G σ ) of G σ is the sum of the norms of all eigenvalues of S ( G σ ) and the skew rank r s ( G σ )
Relation between the skew-rank of an oriented graph and the rank of its underlying graph
TLDR
It is proved that s r ( G ? ) ? r (G ) + 2 d ( G ) for an oriented graph G ?, the oriented graphs G ? whose skew-rank attains the upper bound are characterized.
On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
Abstract An oriented graph G σ is a digraph without loops and multiple arcs, where G is the underlying graph of G σ . Let S ( G σ ) denote the skew-adjacency matrix of G σ , and A ( G ) be the
Skew-rank of an oriented graph with edge-disjoint cycles
An oriented graph is a digraph without loops and multiple arcs, where is called the underlying graph of . Let denote the skew-adjacency matrix of . The rank of is called the skew-rank of , denoted by
Bicyclic oriented graphs with skew-rank 6
TLDR
All the bicyclic oriented graphs with skew-rank 6 are characterized, which is to say, all graphs with pendant vertices but no pendant twins are characterized.
Bicyclic oriented graphs with skew-rank 2 or 4
The skew-rank of oriented graph G ? , denoted by sr ( G ? ) , is the rank of the skew-adjacency matrix of G ? . The skew-rank is even since the skew-adjacency matrix is skew-symmetric. In this paper
Nullity of Hermitian-Adjacency Matrices of Mixed Graphs
A mixed graph means a graph containing both oriented edges and undirected edges. The nullity of the Hermitian-adjacency matrix of a mixed graph G, denoted by ηH(G), is referred to as the multiplicity
The rank of a signed graph in terms of the rank of its underlying graph
Abstract Let Γ = ( G , σ ) be a signed graph and A ( Γ ) be its adjacency matrix, where G is the underlying graph of Γ. The rank r ( Γ ) of Γ is the rank of A ( Γ ) . We know that for a signed graph
On the relation between the H-rank of a mixed graph and the matching number of its underlying graph
Abstract A mixed graph is obtained by orienting some edges of G, where G is the underlying graph of . Let denote the Hermitian adjacency matrix of and m(G) be the matching number of G. The H-rank of
...
1
2
3
...

References

SHOWING 1-10 OF 22 REFERENCES
4-Regular oriented graphs with optimum skew energy
Abstract Let G be a simple undirected graph, and G σ be an oriented graph of G with the orientation σ and skew-adjacency matrix S ( G σ ) . The skew energy of the oriented graph G σ , denoted by E S
The characteristic polynomial and the matchings polynomial of a weighted oriented graph
Abstract Let G σ be a weighted oriented graph with skew adjacency matrix S ( G σ ) . Then G σ is usually referred as the weighted oriented graph associated to S ( G σ ) . Denote by ϕ ( G σ ; λ ) the
Some inequalities on the skew-spectral radii of oriented graphs
Let G be a simple graph and Gσ be an oriented graph obtained from G by assigning a direction to each edge of G. The adjacency matrix of G is A(G) and the skew-adjacency matrix of Gσ is S(Gσ). The
Oriented unicyclic graphs with the first ⌊n-92⌋ largest skew energies
Abstract Let G σ be an oriented graph obtained by assigning an orientation σ to the edge set of a simple undirected graph G such that G σ becomes a directed graph. Let S ( G σ ) be the skew adjacency
Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
Let σ be an orientation of a simple graph H yielding an oriented graph H σ . We define an orientation ψ to the Cartesian product G=H□Q d of H with the hypercube Q d by orienting the edges of G in a
The skew energy of a digraph
We are interested in the energy of the skew-adjacency matrix of a directed graph D, which is simply called the skew energy of D in this paper. Properties of the skew energy of D are studied. In
On the skew energy of orientations of hypercubes
Abstract Let D be a digraph of order n and λ 1 , λ 2 , … , λ n denote all the eigenvalues of the skew-adjacency matrix of D. The skew energy E S ( D ) of D is defined as E S ( D ) = ∑ i = 1 n | λ i |
3-Regular digraphs with optimum skew energy
Abstract The skew energy of a digraph D is defined as the sum of the singular values of its skew adjacency matrix S ( D ) . In this paper, we first interpret the entries of the power of the skew
Skew-adjacency matrices of graphs
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency
Oriented unicyclic graphs with extremal skew energy
Let $\G$ be an oriented graph of order $n$ and $\a_1,\a_2,..., \a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\G.$ The skew energy $\displaystyle{\cal E}_s(\G)= \sum_{i=1}^{n}
...
1
2
3
...