Results 31 to 40 of about 1,914,031 (237)
Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix [PDF]
Linear Algebra and its Applications, 1999 In [8] and [9] W. Mackens and the present author presented two generalizations of a method of Cybenko and Van Loan [4] for computing the smallest eigenvalue of a symmetric, positive definite Toeplitz matrix. Taking advantage of the symmetry or skew-symmetry of the corresponding eigenvector both methods are improved considerably.
Heinrich Voß
openalex +4 more sources
The dual eigenvalue problems of the conformable fractional Sturm–Liouville problems
Boundary Value Problems, 2021 In this paper, we are concerned with the eigenvalue gap and eigenvalue ratio of the Dirichlet conformable fractional Sturm–Liouville problems. We show that this kind of differential equation satisfies the Sturm–Liouville property by the Prüfer ...
Yan-Hsiou Cheng
doaj +1 more source
A Nordhaus–Gaddum conjecture for the minimum number of distinct eigenvalues of a graph [PDF]
Linear Algebra and its Applications, 2018 We propose a Nordhaus-Gaddum conjecture for $q(G)$, the minimum number of distinct eigenvalues of a symmetric matrix corresponding to a graph $G$: for every graph $G$ excluding four exceptions, we conjecture that $q(G)+q(G^c)\le |G|+2$, where $G^c$ is the complement of $G$.
Rupert H. Levene +2 more
openalex +4 more sources
New lower bounds of the minimum eigenvalue for the Fan product of several M-matrices
AIMS Mathematics, 2023 In this study, we generalize the definition of the Fan product of two M-matrices to any $ k $ M-matrices $ {{A}_{1}}, {{A}_{2}}, \cdots, {{A}_{k}} $ of order $ n $.
Qin Zhong
doaj +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
Journal of Hebei University of Science and Technology, 2019 In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n－4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source
Minimum supports of eigenfunctions with the second largest eigenvalue of the Star graph [PDF]
The Electronic Journal of Combinatorics, 2019 The Star graph $S_n$, $n\ge 3$, is the Cayley graph on the symmetric group $Sym_n$ generated by the set of transpositions $\{(12),(13),\ldots,(1n)\}$. In this work we study eigenfunctions of $S_n$ corresponding to the second largest eigenvalue $n-2$.
V. V. Kabanov +3 more
openalex +5 more sources
SNR walls in eigenvalue-based spectrum sensing
EURASIP Journal on Wireless Communications and Networking, 2017 Various spectrum sensing approaches have been shown to suffer from a so-called signal-to-noise ratio (SNR)-wall, an SNR value below which a detector cannot perform robustly no matter how many observations are used. Up to now, the eigenvalue-based maximum-
Andreas Bollig +3 more
doaj +1 more source
On the Neumann eigenvalues for second-order Sturm–Liouville difference equations
Advances in Difference Equations, 2020 The paper is concerned with the Neumann eigenvalues for second-order Sturm–Liouville difference equations. By analyzing the new discriminant function, we show the interlacing properties between the periodic, antiperiodic, and Neumann eigenvalues ...
Yan-Hsiou Cheng
doaj +1 more source
Maxima of the Q-index: graphs without long paths [PDF]
, 2013 This paper gives tight upper bound on the largest eigenvalue q(G) of the signless Laplacian of graphs with no paths of given order. The main ingredient of our proof is a stability result of its own interest, about graphs with large minimum degree and ...
Nikiforov, Vladimir, Yuan, Xiying
core +1 more source
On completely regular codes with minimum eigenvalue in geometric graphs
Discrete Mathematics, 2023 We prove that any completely regular code with minimum eigenvalue in any geometric graph G corresponds to a completely regular code in the clique graph of G. Studying the interrelation of these codes, a complete characterization of the completely regular codes in the Johnson graphs J(n,w) with covering radius w-1 and strength 1 is obtained.
I.Yu. Mogilnykh, K.V. Vorob'ev
openaire +2 more sources