Results 31 to 40 of about 340,902 (280)
Signed Graphs with extremal least Laplacian eigenvalue
Linear Algebra and its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Belardo, Yue Zhou
openaire +2 more sources
On the least eigenvalue of Hill’s equation [PDF]
Quarterly of Applied Mathematics, 1951 In der Hillschen Differentialgleichung \[ x''(t) + [\lambda + f(t)] x(t) = 0 \tag{1}\] sei \(f(t)\) eine reelle stetige Funktion der Periode \(1\) mit der Fourierentwicklung \[ f(t) \sim \sum_{n= -\infty}^{+\infty} c_ne^{2\pi int}. \tag{2} \] Der kleinste Wert \(\mu\) des invarianten Spektrums von (1) im Sinne von \textit{H. Weyl} [Math. Ann.
openaire +1 more source
The Ordinary Least Eigenvalues Estimator
, 2023 We propose a rate optimal estimator for the linear regression model on network data with interacted (unobservable) individual effects. The estimator achieves a faster rate of convergence $N$ compared to the standard estimators' $\sqrt{N}$ rate and is efficient in cases that we discuss.
openaire +2 more sources
The least eigenvalues of nonhomogeneous degenerated quasilinear eigenvalue problems [PDF]
Mathematica Bohemica, 1995 Summary: We prove the existence of the least positive eigenvalue with a corresponding nonnegative eigenfunction of the quasilinear eigenvalue problem \[ -\text{div}(a(x, u) |\nabla u|^{p- 2} \nabla u)= \lambda b(x, u)|u|^{p- 2} u\quad\text{in }\Omega,\quad u= 0\quad\text{on }\partial\Omega, \] where \(\Omega\) is a bounded domain, \(p> 1\) is a real ...
openaire +1 more source
The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix
Journal of Mathematics, 2021 All graphs under consideration are finite, simple, connected, and undirected. Adjacency matrix of a graph G is 0,1 matrix A=aij=0, if vi=vj or dvi,vj≥21, if dvi,vj=1.. Here in this paper, we discussed new type of adjacency matrix known by 1-2 adjacency
Lubna Gul +3 more
doaj +1 more source
Gershgorin disks for multiple eigenvalues of non-negative matrices
, 2016 Gershgorin's famous circle theorem states that all eigenvalues of a square matrix lie in disks (called Gershgorin disks) around the diagonal elements. Here we show that if the matrix entries are non-negative and an eigenvalue has geometric multiplicity ...
A. Berman +11 more
core +1 more source
Notes on graphs with least eigenvalue at least -2
The Electronic Journal of Linear Algebra, 2012 A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetkovic and Lepovic, with least eigenvalue at least 2 is revisited and given a new equivalent definition (D. Cvetkovic and M. Lepovic. Cospectral graphs with least eigenvalue at least 2. Publ.
Jianfeng Wang +2 more
openaire +2 more sources
Three solutions for discrete anisotropic Kirchhoff-type problems
Demonstratio Mathematica, 2023 In this article, using critical point theory and variational methods, we investigate the existence of at least three solutions for a class of double eigenvalue discrete anisotropic Kirchhoff-type problems.
Bohner Martin +3 more
doaj +1 more source
Distance-regular Cayley graphs with least eigenvalue $-2$
Designs Codes and Cryptography, 2015 13 pages, On line paper as open access to publish in Des.
van Dam, Edwin R. +2 more
openaire +2 more sources
Discussiones Mathematicae Graph Theory, 2013 The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj +1 more source