Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph
Publish place: Transactions on Combinatorics، Vol: 8، Issue: 2
Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 163
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-8-2_001
تاریخ نمایه سازی: 14 اردیبهشت 1400
Abstract:
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}$.
Keywords:
Authors
Hilal A. Ganie
Gonipora Karahama