Results 81 to 90 of about 26,944 (191)

Bounds for the minimum degree eigenvalues of graphs

Boletim da Sociedade Paranaense de Matemática
In this paper we obtain several upper bounds for the minimum degree eigenvalues of Graph G.
openaire   +1 more source

Advanced Spectrum Sensing Techniques for Robust Train-to-Train Wireless Communication Systems: A Comprehensive Evaluation

IEEE Access
In the context of full automation of train operation, flexible train management, and improved traffic capacity, the Next Generation Train Control and Monitoring System (NG-TCMS) represents a key technology.
Chadli Hadji, Yamen Alsaba, Marion Berbineau, Fouzia Elbahhar, Rodrigue Fargeon   +4 more
doaj   +1 more source

Robust and minimum norm partial quadratic eigenvalue assignment problems : theory and computations

, 2006
The partial eigenvalue assignment problem for a second-order control system, called the partial quadratic eigenvalue assignment problem (PQEVAP), is one of reassigning a few “troublesome” eigenvalues by using feedback while leaving the remaining large ...
Brahma, Sanjoy Kumar
core  

New lower bounds on eigenvalue of the Hadamard product of an M-matrix and its inverse

, 2009
Some new lower bounds for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse are given. These bounds improve the results of [H.B. Li, T.Z. Huang, S.Q. Shen, H.
Wang, De-Feng, Li, Yao-Tang, Chen, Fu-Bin   +2 more
core   +1 more source

Covariance Based Spectrum Sensing with Studentized Extreme Eigenvalue

, 2018
The eigenvalue based detection is a low-cost spectrum sensing method that detects the presence of primary user signal at a desired frequency. In this study, the largest eigenvalue distribution used in eigenvalue based detection methods is expressed using
Çiflikli, Cebrail, Ilgin, Fatih Yavuz, Fatih Yavuz Ilgin, Cebrail Çiflikli   +3 more
core   +1 more source

Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns

, 2006
The set of real matrices described by a sign pattern (a matrix whose entries are elements of {+,−,0}) has been studied extensively but only loose bounds were available for the minimum rank of a tree sign pattern.
Hardy, Timothy L., Hogben, Leslie, Hentzel, Irvin Roy, DeAlba, Luz Maria, Wangsness, Amy, DeAlba, Luz, Hentzel, Irvin, Hardy, Timothy   +7 more
core   +1 more source

The least eigenvalue of the complements of graphs with given connectivity

, 2023
The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain the minimum least eigenvalue among all complements of connected simple graphs with given connectivity.Comment: 10 ...
Li, Keng, Qiu, Huan, Wang, Guoping
core  

Minimum vertex covers and the spectrum of the normalized Laplacian on trees

, 2012
We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers.In particular, for the eigenvalue 1, its multiplicity is related to the size of a ...
Jost, Jürgen, Hao Chen, Jürgen Jost, Chen, Hao   +3 more
core   +1 more source

The minimum Laplacian spread of unicyclic graphs

, 2010
The Laplacian spread of a graph [1] is defined as the difference between the largest eigenvalue and the second-smallest eigenvalue of the associated Laplacian matrix.
Liu, Bolian, You, Zhifu
core   +1 more source

RESIDUAL FORCE MINIMUM RANK UPDATE METHOD FOR DAMAGE IDENTIFICATION OF SPACE TRUSS STRUCTURES

Jixie qiangdu, 2019
Based on the minimum rank damage identification method,a minimum rank update method is proposed to study the damage identification of space truss structures.
JIANG Ge, FENG XiaoDong
doaj