Results 271 to 280 of about 38,430 (291)
Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions [PDF]
Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions.
Domingos M Cardoso, Inés Serôdio Costa
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Inverse Problems on the Least Eigenvalue
Results in Mathematics, 2013The paper deals with generalizations of the classical Ambarzumyan theorem, which, as is well-known, can be formulated in the following way: if the first (i.e., smallest) eigenvalue \(\lambda_0\) of the Sturm-Liouville operator \[ Ay:=-y''+q(x)y, \quad ...
Yang, Jie, Yang, Chuan-Fu
openaire +2 more sources
THE LEAST EIGENVALUE OF GRAPHS
Far East Journal of Mathematical Sciences (FJMS), 2018In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order. Keywords graph; complement; adjacency matrix; least eigenvalue.
Chen Wang, Wei Sun, Guidong Yu, Wei Wei
openaire +1 more source
On the least eigenvalue of A-matrix of graphs
Linear Algebra and its Applications, 2020Abstract Let G be a graph of order n with m edges and chromatic number χ. Let A ( G ) be the adjacency matrix and D ( G ) be the diagonal matrix of vertex degrees of G. Nikiforov defined the matrix A α ( G ) as A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) , where 0 ≤ α ≤ 1 . Then
Shuting Liu +3 more
openaire +1 more source
The least Q-eigenvalue with fixed domination number
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guanglong Yu +3 more
openaire +2 more sources
The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
Discrete Mathematics, 2020Yi-Zheng Fan
exaly
Least-squares formulations for eigenvalue problems associated with linear elasticity
Computers and Mathematics With Applications, 2021Fleurianne Bertrand, Daniele Boffi
exaly
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Discrete Mathematics, 2014Yi-Zheng Fan
exaly
Regularized Total Least Squares Based on Quadratic Eigenvalue Problem Solvers
BIT Numerical Mathematics, 2004Sabine Van Huffel +2 more
exaly

