Skew-rank of an oriented graph and independence number of its underlying graph

• Xueliang Li
• Wen Xia
Article

Abstract

An oriented graph $$G^\sigma$$ is a digraph which is obtained by orienting every edge of a simple graph G, where G is called the underlying graph of $$G^\sigma$$. Let $$S(G^\sigma )$$ denote the skew-adjacency matrix of $$G^\sigma$$ and $$\alpha (G)$$ be the independence number of G. The rank of $$S(G^\sigma )$$ is called the skew-rank of $$G^\sigma$$, denoted by $$sr(G^\sigma )$$. Wong et al. studied the relation between the skew-rank of an oriented graph and the rank of its underlying graphs. Huang et al. recently studied the relationship between the skew-rank of an oriented graph and the independence number of its underlying graph, by giving some lower bounds for the sum, difference and quotient etc. They left over some questions for further studying the upper bounds of these parameters. In this paper, we extend this study by showing that $$sr(G^\sigma )+ 2\alpha (G) \le 2n$$, where n is the order of G, and two classes of oriented graphs are given to show that the upper bound 2n can be achieved. Furthermore, we answer some open questions by obtaining sharp upper bounds for $$sr(G^\sigma ) + \alpha (G)$$, $$sr(G^\sigma ) - \alpha (G)$$ and $$sr(G^\sigma ) / \alpha (G)$$.

Keywords

Skew-rank Oriented graph Oddly-oriented Independence number

05C50

Notes

Acknowledgements

The authors are very grateful to the reviewers and editors for their detailed suggestions and comments which are very helpful to improve our paper.

References

1. Anuradha A, Balakrishnan R (2013) Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube. In: Bapat RB, Kirkland SJ, Prasad KM, Puntanen S (eds) Combinatorial matrix theory and generalized inverses of matrices. Springer, Berlin, pp 1–12Google Scholar
2. Anuradha A, Balakrishnan R, Chen X, Li X, Lian H, So W (2013) Skew spectra of oriented bipartite graphs. Electron J Comb 20(4):P19
3. Bondy JA, Murty USR (2008) Graph theory, GTM, vol 244. Springer, Berlin
4. Cavers M, Cioabǎ SM, Fallat S, Gregory DA, Haemers WH, Kirkland SJ, McDonald JJ, Tsatsomeros M (2012) Skew-adjacency matrices of graphs. Linear Algebra Appl 436:4512–4529
5. Cvetković D, Doob M, Sachs H (1995) Spectra of graphs, 3rd edn. Johann Ambrosius Barth, Heidelberg
6. Deng B, Li X, Shader B, So W (2018) On the maximum skew spectral radius and minimum skew energy of tournaments. Linear & Multilinear Algebra 66(7):1434–1441
7. Haranta J, Schiermeyer I (2001) Note on the independence number of a graph in terms of order and size. Discrete Math 232:131–138
8. Hou Y, Lei T (2011) Charactristic polynomial of skew-adjacency matrices of oriented graphs. Electron J Comb 18:P156
9. Huang J, Li S, Wang H (2018) Relation between the skew-rank of an oriented graph and the independence number of its underlying graph. J Comb Optim 36(1):65–80
10. Li X, Lian H (2016) Skew energy of oriented graphs. In: Gutman I, Li X (eds) Energies of graphs—theory and applications, Mathematical Chemistry Monographs No. 17. University of Kragujevac, Kragujevac, pp 191–236Google Scholar
11. Li X, Yu G (2015) The skew-rank of oriented graphs. Sci China Math 45:93–104 (Chinese)Google Scholar
12. Lu Y, Wang L, Kong Q (2017) The skew-rank of some oriented graphs. Math Appl 30:105–111 (Chinese)
13. Ma X, Wong D, Tian F (2016) Skew-rank of an oriented graph in terms of matching number. Linear Algebra Appl 495:242–255
14. Shader B, So W (2009) Skew spectra of oriented graphs. Electron J Combin 16:N32
15. Wong D, Ma X, Tian F (2016) Relation between the skew-rank of an oriented graph and the rank of its underlying graphs. Eur J Comb 54:76–86

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

• Xueliang Li
• 1
• 2
• Wen Xia
• 1
1. 1.Center for Combinatorics and LPMCNankai UniversityTianjinChina
2. 2.School of Mathematics and StatisticsQinghai Normal UniversityXiningChina