Results 31 to 40 of about 38,430 (291)
Examples and Counterexamples, 2022 We continue the investigation on the spectrum of operators arising from the discretization of partial differential equations. In this paper we consider a three field formulation recently introduced for the finite element least-squares approximation of ...
Linda Alzaben +2 more
doaj +1 more source
Least eigenvalue of the connected graphs whose complements are cacti
Open Mathematics, 2019 Suppose that Γ is a graph of order n and A(Γ) = [ai,j] is its adjacency matrix such that ai,j is equal to 1 if vi is adjacent to vj and ai,j is zero otherwise, where 1 ≤ i, j ≤ n.
Wang Haiying +4 more
doaj +1 more source
On the largest and least eigenvalues of eccentricity matrix of trees
Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaocong He, Lu Lu
openaire +1 more source
On the eigenvalues of firefly graphs [PDF]
Transactions on Combinatorics, 2014 The sharp upper bounds and the sharp lower bounds of the largest eigenvalues $lambda_1$, the least eigenvalue $lambda_n$, the second largest eigenvalue $lambda_2$, the spread and the separator among all firefly graphs on $n$ vertices are determined.
Hong Wenxi, You Lihua
doaj
Inverse Eigenvalue Problem and Least-Squares Problem for Skew-Hermitian {P,K + 1}-Reflexive Matrices
Journal of Mathematics, 2022 This paper involves related inverse eigenvalue problem and least-squares problem of skew-Hermitian {P,k + 1}-reflexive(antireflexive) matrices and their optimal approximation problems.
Chang-Zhou Dong, Hao-Xue Li
doaj +1 more source
On Least Distance Eigenvalue of Uniform Hypergraphs
Taiwanese Journal of Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Hongying, Zhou, Bo
openaire +2 more sources
Bicyclic graphs for which the least eigenvalue is minimum [PDF]
, 2009 The spread of a graph is defined to be the difference between the greatest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. In this paper we determine the unique graph with minimum least eigenvalue among all connected bicyclic ...
Aleksić, Tatjana +2 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
On graphs whose least eigenvalue exceeds − 1 − √2 [PDF]
, 1977 Let G be a graph, A(G) its adjacency matrix. We prove that, if the least eigenvalue of A(G) exceeds -1 − √2 and every vertex of G has large valence, then the least eigenvalue is at least -2 and G is a generalized line ...
Hoffman, A.J.
core +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