Results 41 to 50 of about 254 (116)
Some new bounds on the spectral radius of nonnegative matrices
In this paper, we determine some new bounds for the spectral radius of a nonnegative matrix with respect to a new defined quantity, which can be considered as an average of average 2-row sums.
Maria Adam +2 more
doaj +1 more source
A general result on the spectral radii of nonnegative k-uniform tensors
In this paper, we define $k$-uniform tensors for $k\geq 2$, which are more closely related to the $k$-uniform hypergraphs than the general tensors, and introduce the parameter $r^{(q)}_{i}(\mathbb{A})$ for a tensor $\mathbb{A}$, which is the ...
Chuang Lv, Lihua You, Yufei Huang
doaj +1 more source
Signless Laplacian spectral radius and fractional matchings in graphs [PDF]
Yingui Pan, Jianping Li
+5 more sources
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius [PDF]
Sizhong Zhou +3 more
openalex +1 more source
Signless Laplacian spectral radius for a k-extendable graph [PDF]
Zhou Sizhong, Zhang Yuli
openalex +1 more source
The signless Laplacian spectral radius of graphs without trees [PDF]
Chen, Ming-Zhu +2 more
openalex +1 more source
Exploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza +3 more
doaj +1 more source
Laplacian spectra and structural insights: applications in chemistry and network science
This paper presents the practical applications of Laplacian and signless Laplacian spectra across various fields including theoretical chemistry, computer science, electrical engineering, and complex network analysis.
Ali Raza, Muhammad Mobeen Munir
doaj +1 more source
Signless Laplacian spectral radius of graphs without short cycles or long cycles [PDF]
Wenwen Chen, Bing Wang, Mingqing Zhai
openalex +1 more source
Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor
LetGbe a graph. An odd [1,k]-factor of a graph G is a spanning subgraph H of G such that degH(v) is odd and 1⩽degH(v)⩽k for every v∈V(G) where k is a positive odd integer. We call a spanning subgraph H of a graph G a strong star factor if every component
Fengyun Ren, Shumin Zhang, He Li
doaj +1 more source

