Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph

‎‎for a simple connected graph g with n vertices and m edges‎, ‎let 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 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 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 g‎→.