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)−12 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.