For a simple connected graph $G$ with $n$ vertices and $m$ edges, let $\overrightarrow{G}$ be a digraph obtained by giving an arbitrary direction to the edges of $G$. In this paper, we consider the skew Laplacian/skew adjacency matrix of the digraph $\overrightarrow{G}$. We obtain upper bounds for the skew Laplacian/skew adjacency spectral radius, in terms of various parameters (like oriented degree, average oriented degree) associated with the structure of the digraph $\overrightarrow{G}$. We also obtain upper and lower bounds for the skew Laplacian/skew adjacency spectral radius, in terms of skew Laplacian/skew adjacency rank of the digraph $\overrightarrow{G}$.
Ganie, H. A. (2019). Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph. Transactions on Combinatorics, 8(2), 1-12. doi: 10.22108/toc.2019.112589.1582
MLA
Ganie, H. A. . "Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph", Transactions on Combinatorics, 8, 2, 2019, 1-12. doi: 10.22108/toc.2019.112589.1582
HARVARD
Ganie, H. A. (2019). 'Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph', Transactions on Combinatorics, 8(2), pp. 1-12. doi: 10.22108/toc.2019.112589.1582
CHICAGO
H. A. Ganie, "Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph," Transactions on Combinatorics, 8 2 (2019): 1-12, doi: 10.22108/toc.2019.112589.1582
VANCOUVER
Ganie, H. A. Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph. Transactions on Combinatorics, 2019; 8(2): 1-12. doi: 10.22108/toc.2019.112589.1582
)
