Solution to a problem on skew spectral radii of oriented graphs
نویسندگان
چکیده
منابع مشابه
New skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملon the skew spectral moments of graphs
let $g$ be a simple graph, and $g^{sigma}$ be an oriented graph of $g$ with the orientation $sigma$ and skew-adjacency matrix $s(g^{sigma})$. the $k-$th skew spectral moment of $g^{sigma}$, denoted by $t_k(g^{sigma})$, is defined as $sum_{i=1}^{n}( lambda_{i})^{k}$, where $lambda_{1}, lambda_{2},cdots, lambda_{n}$ are the eigenvalues of $g^{sigma}$. suppose $g^{sigma...
متن کاملSolution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs
Let G be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Linear Algebra Appl. 436(12):4512-1829, 2012] showed that the spectral radius of G is the same for every orientation σ of G, and equals the maximum matching root of G. They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs G of order n are isomorphic...
متن کاملSkew Spectra of Oriented Graphs
An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge a direction so that G becomes a directed graph. G is called the underlying graph of G, and we denote by Sp(G) the adjacency spectrum of G. Skew-adjacency matrix S(G) of G is introduced, and its spectrum SpS(G ) is called the skew-spectrum of G . The relationship between SpS(G ) and Sp(G) is stud...
متن کاملOn oriented graphs with minimal skew energy
Let S(Gσ) be the skew-adjacency matrix of an oriented graph Gσ . The skew energy of Gσ is the sum of all singular values of its skew-adjacency matrix S(Gσ). This paper first establishes an integral formula for the skew energy of an oriented graph. Then, it determines all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m (n ≤ m < 2(n− 2)) arcs, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2017
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.02.022