Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2
Authors:
Open Access
- 7 November 2013
- journal article
- research article
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2013 (1) , 495
Abstract
Let S ( G σ ) be the skew-adjacency matrix of an oriented graph G σ with n vertices, and let λ 1 , λ 2 , … , λ n be all eigenvalues of S ( G σ ) . The skew-spectral radius ρ s ( G σ ) of G σ is defined as max { | λ 1 | , | λ 2 | , … , | λ n | } . A connected graph, in which the number of edges equals the number of vertices, is called a unicyclic graph. In this paper, the structure of oriented unicyclic graphs whose skew-spectral radius does not exceed 2 is investigated. We order all the oriented unicyclic graphs with n vertices whose skew-spectral radius is bounded by 2. MSC:05C50, 15A18.Keywords
This publication has 8 references indexed in Scilit:
- Skew-adjacency matrices of graphsLinear Algebra and its Applications, 2012
- 3-Regular digraphs with optimum skew energyLinear Algebra and its Applications, 2012
- The skew energy of a digraphLinear Algebra and its Applications, 2010
- Some notes on graphs whose spectral radius is close toLinear Algebra and its Applications, 2008
- Ordering graphs with index in the intervalDiscrete Applied Mathematics, 2008
- On Graphs Whose Spectral Radius is Bounded by $\frac{3}{2}\sqrt{2}$Graphs and Combinatorics, 2007
- The graphs with spectral radius between 2 and 2+5Linear Algebra and its Applications, 1989
- On limit points of spectral radii of non-negative symmetric integral matrices1972