Results 61 to 70 of about 306 (150)

The Largest Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter

Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013
We identify graphs with the maximal Laplacian spectral radius among all unicyclic graphs with n vertices and diameter d.
Haixia Zhang, Baolin Wang
wiley   +1 more source

The Aα-Spectral Radii of Graphs with Given Connectivity

Mathematics, 2019
The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its ...
Chunxiang Wang, Shaohui Wang
doaj   +1 more source

Some Results on the Signless Laplacian Spectra of Unicyclic Graphs

International Scholarly Research Notices, Volume 2011, Issue 1, 2011., 2011
We determine the second to fourth largest (resp. the second smallest) signless Laplacian spectral radii and the second to fourth largest signless Laplacian spreads together with the corresponding graphs in the class of unicyclic graphs with n vertices.
Muhuo Liu, M. Asaad, P. Koshlukov
wiley   +1 more source

Some new bounds on the spectral radius of nonnegative matrices

AIMS Mathematics, 2020
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, Dimitra Aggeli, Aikaterini Aretaki   +2 more
doaj   +1 more source

The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

Discrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xi, Weige, Wang, Ligong
openaire   +1 more source

A general result on the spectral radii of nonnegative k-uniform tensors

AIMS Mathematics, 2020
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

A Spectrum-Based Approach to Network Analysis Utilizing Laplacian and Signless Laplacian Spectra to Torus Networks

IEEE Access
Exploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza, Mobeen Munir, Muhammad Hussain, Fikadu Tasgera   +3 more
doaj   +1 more source

Laplacian spectra and structural insights: applications in chemistry and network science

Frontiers in Applied Mathematics and Statistics
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

Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor

Mathematics
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

Signless Laplacian spectral radius and fractional matchings in graphs

, 2019
A fractional matching of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ such that $\sum_{e\in (v)}f(e)\leq1$ for each vertex $v\in V(G)$, where $ (v)$ is the set of edges incident to $v$. The fractional matching number of $G$, written $ ^{\prime}_*(G)$, is the maximum value of $\sum_{e\in E(G)}f(e)$ over all fractional matchings.
Pan, Yingui, Li, Jianping
openaire   +2 more sources