Results 1 to 10 of about 38,430 (291)
Cospectral graphs with least eigenvalue at least -2 [PDF]
Publications de l'Institut Mathematique, 2005 We study the phenomenon of cospectrality in generalized line graphs and in exceptional graphs. We survey old results from today's point o view and obtain some new results partly by the use of compute. Among.other things we show that a connected generalized line graph L(H) has an exceptional cospectral mate only if its root graph H, assuming it is ...
Cvetković, Dragoš, Lepović, Mirko
openaire +3 more sources
Polynomial fitting based on least squares approximates for first-order Tracy-Widom distribution [PDF]
ITM Web of Conferences, 2022 Tracy-Widom distribution can primely describe the limit distribution of the largest eigenvalue of noise matrix, so it is widely used in the field of signal processing and wireless communication.
Tian Chong +4 more
doaj +1 more source
Characterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
Mathematics, 2017 In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of ...
Muhammad Javaid
doaj +1 more source
Solving Nonlinear Second Order Delay Eigenvalue Problems by Least Square Method
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2020 The aim of this paper is to study the nonlinear delay second order eigenvalue problems which consists of delay ordinary differential equations, in fact one of the expansion methods that is called the least square method which will be developed to ...
Israa M. Salman, Eman A. Abdul-Razzaq
doaj +1 more source
Graphs with eigenvalues at least −2
Linear Algebra and its Applications, 1982 AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is described. It is shown that each minimal forbidden graph has at most 10 vertices and the bound is the best possible.
Kumar, Vijaya, Rao, S.B., Singhi, N.M.
openaire +2 more sources
On graphs with smallest eigenvalue at least −3 and their lattices [PDF]
Advances in Mathematics, 2018 In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2.
Koolen, Jack H. +2 more
openaire +3 more sources
The Least Eigenvalue of the Complement of the Square Power Graph of G
Complexity, 2021 Let Gn,m represent the family of square power graphs of order n and size m, obtained from the family of graphs Fn,k of order n and size k, with m≥k. In this paper, we discussed the least eigenvalue of graph G in the family Gn,mc.
Lubna Gul +3 more
doaj +1 more source
Electronic Journal of Qualitative Theory of Differential Equations, 2023 In this paper we consider the Dirichlet problem for quasi-linear second-order elliptic equation with the $m(x)$-Laplacian and the strong nonlinearity on the right side in an unbounded cone-like domain.
Mikhail Borsuk, Damian Wiśniewski
doaj +1 more source
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
Journal of Inequalities and Applications, 2016 A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013) and Liu et al. (Electron. J.
Shu-Guang Guo +3 more
doaj +1 more source
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