Results 21 to 30 of about 38,430 (291)
On distance-regular graphs with smallest eigenvalue at least −m [PDF]
Journal of Combinatorial Theory, Series B, 2010 A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer $m\geq 2$, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least $-m$, diameter at least three and intersection ...
Jacobus H. Koolen, Sejeong Bang
core +6 more sources
The least eigenvalue of graphs with given connectivity [PDF]
Linear Algebra and its Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ye, Miao-Lin, Fan, Yi-Zheng, Liang, Dong
openaire +2 more sources
Distance-regular Cayley graphs with least eigenvalue $-2$ [PDF]
Des. Codes Cryptogr., 2015 13 pages, On line paper as open access to publish in Des.
Alireza Abdollahi +2 more
openaire +4 more sources
The Chromatic Number and the Least Eigenvalue of a Graph [PDF]
The Electronic Journal of Combinatorics, 2012 In this paper we get a structural property for a graph having the minimal least eigenvalue among all graphs of fixed order and given chromatic number, and characterize such graphs under the condition that the chromatic number is not larger than half the order of the graph.
Yi-Zheng Fan, Gui-Dong Yu, Yi Wang
openaire +2 more sources
On the second minimizing graph in the set of complements of trees
AKCE International Journal of Graphs and Combinatorics, 2019 Let be a graph of order and be its adjacency matrix such that if is adjacent to and otherwise, where . In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of its adjacency matrix attains the minimum (
M. Javaid
doaj +2 more sources
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
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
Robust Adaptive Identification of Linear Time-Varying Systems Under Relaxed Excitation Conditions
IEEE Access, 2020 An on-line modified least-squares identification algorithm is proposed for linear time-varying systems with bounded disturbances under relaxed excitation conditions.
Yifei Hu, Jinbo Wu, Chenghao Zeng
doaj +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.
Navin M. Singhi +1 more
openaire +1 more source
Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝕋4 = {±1, ±i} be the subgroup of 4-th roots of unity inside 𝕋, the multiplicative group of complex units. A complex unit gain graph Φ is a simple graph Γ = (V (Γ) = {v1, . . .
Belardo Francesco +2 more
doaj +1 more source