نتایج جستجو برای: sign real spectral radius

تعداد نتایج: 778355  

 It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.  

Journal: :Proceedings of the Edinburgh Mathematical Society 1979

Journal: :bulletin of the iranian mathematical society 2015
j. li b. zhou

it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.

Journal: :transactions on combinatorics 2014
alireza abdollahi shahrooz janbaz

let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...

Journal: :transactions on combinatorics 2014
ran gu fei huang xueliang li

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and $d_i$ the degree of its vertex $v_i$, $i = 1, 2,cdots, n$. inspired by the randi'c matrix and the general randi'cindex of a graph, we introduce the concept of general randi'cmatrix $textbf{r}_alpha$ of $g$, which is defined by$(textbf{r}_alpha)_{i,j}=(d_id_j)^alpha$ if $v_i$ and $v_j$ areadjacent, and zero otherwise. s...

Journal: :iranian journal of mathematical chemistry 2015
a. maden e. kaya

in this paper, we present some inequalities for the co-pi index involving the some topological indices, the number of vertices and edges, and the maximum degree. after that, we give a result for trees. in addition, we give some inequalities for the largest eigenvalue of the co-pi matrix of g.

2010
NILS BYRIAL ANDERSEN MARCEL DE JEU

We systematically develop real Paley–Wiener theory for the Fourier transform on Rd for Schwartz functions, Lp-functions and distributions, in an elementary treatment based on the inversion theorem. As an application, we show how versions of classical Paley–Wiener theorems can be derived from the real ones via an approach which does not involve domain shifting and which may be put to good use fo...

2011
Minerva Catral Leslie Hogben D. D. Olesky

A matrix A ∈ Rn×n is eventually nonnegative (respectively, eventually positive) if there exists a positive integer k0 such that for all k ≥ k0, A ≥ 0 (respectively, A > 0). Here inequalities are entrywise and all matrices are real and square. An eigenvalue of A is dominant if its magnitude is equal to the spectral radius of A. A matrix A has the strong Perron-Frobenius property if A has a uniqu...

2010
V. A. Strauss C. Trunk

Sign type spectra are an important tool in the investigation of spectral properties of selfadjoint operators in Krein spaces. It is our aim to show that also sign type spectra for normal operators in Krein spaces provide insight in the spectral nature of the operator: If the real part and the imaginary part of a normal operator in a Krein space have real spectra only and if the growth of the re...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید