Abstract
Let G be a simple connected graph on n vertices, and let Gσ be an orientation of G with skew adjacency matrix S(Gσ). Let di be the degree of the vertex vi in G. The skew Randić matrix of Gσ is the n×n real skew symmetric matrix RS(Gσ)=[(RS)ij], where (RS)ij=−(RS)ji=(didj)−[Formula presented] if (vi,vj) is an arc of Gσ, and (RS)ij=(RS)ji=0 otherwise. The skew spectral radius ρS(Gσ) and the skew Randić spectral radius ρRS(Gσ) of Gσ are defined as the spectral radius of S(Gσ) and RS(Gσ) respectively. In this paper we give upper bounds for the skew spectral radius and skew Randić spectral radius of general random oriented graphs.
Original language | English |
---|---|
Pages (from-to) | 125-137 |
Number of pages | 13 |
Journal | Linear algebra and its applications |
Volume | 685 |
Early online date | 5 Jan 2024 |
DOIs | |
Publication status | Published - 15 Mar 2024 |
Keywords
- UT-Hybrid-D
- Random skew adjacency matrix
- Random skew Randić matrix
- Skew Randić spectral radius
- Skew spectral radius
- General random oriented graphs