Results 11 to 20 of about 340,902 (280)
Spectral properties of a class of unicyclic graphs
Journal of Inequalities and Applications, 2017 The eigenvalues of G are denoted by λ 1 ( G ) , λ 2 ( G ) , … , λ n ( G ) $\lambda_{1}(G), \lambda_{2}(G), \ldots, \lambda_{n}(G)$ , where n is the order of G.
Zhibin Du
doaj +1 more source
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
Cospectral graphs with least eigenvalue at least -2
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 +2 more sources
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
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
Spanning trees and even integer eigenvalues of graphs [PDF]
, 2014 For a graph $G$, let $L(G)$ and $Q(G)$ be the Laplacian and signless Laplacian matrices of $G$, respectively, and $\tau(G)$ be the number of spanning trees of $G$.
Ghorbani, Ebrahim
core +1 more source
Signed graphs with least eigenvalue <−2
European Journal of Combinatorics, 1992 A simple proof is given of the fact that every signed graph with an eigenvalue that is smaller than --2 contains an induced (signed) subgraph whose smallest eigenvalue is equal to --2.
Singhi, N.M., Vijayakumar, G.R.
openaire +1 more source
Journal of Inequalities and Applications, 2017 In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj +1 more source
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