Results 171 to 180 of about 63,846 (213)

A relation between the Laplacian and signless Laplacian eigenvalues of a graph [PDF]

, 2010
Saieed Akbari, Ebrahim Ghorbani, Jack H. Koolen, Mohammad Reza Oboudi   +3 more
openalex   +1 more source

Note on the Sum of Powers of Signless Laplacian Eigenvalues of Graphs [PDF]

, 2014
Ş. Burcu Bozkurt Altındağ, Durmuş Bozkurt   +1 more
openalex   +1 more source

Layout analysis of the RCEP international airline network based on hub identification using improved contribution matrix. [PDF]

Sci Rep
Yang W, Chi Y, Huang Y, Wei W, Xu Z.
europepmc   +1 more source

Graphs determined by their (signless) Laplacian spectra

, 2011
Muhuo Liu, Bo Liu, Fuyi Wei
openalex   +2 more sources

The minimum spetral radius of signless Laplacian of graphs with a given clique number

, 2013
Honghai Li, Li Su, Jing Zhang
openalex   +1 more source

The Bounds for Eigenvalues of Normalized Laplacian Matrices and Signless Laplacian Matrices

, 2014
Şerife Büyükköse, Şehri Gülčiček Eski   +1 more
openalex   +2 more sources

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene‐Quadrilateral Structures

Journal of Mathematics, Volume 2025, Issue 1, 2025.
This study investigates the spectral and topological properties of rounded knot networks , a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology
Fareeha Hanif, Ali Raza, Md. Shajib Ali
semanticscholar   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Signless Laplacian spectral radius for a k-extendable graph

Filomat, 2023
Let k and n be two nonnegative integers with n ? 0 (mod 2), and let G be a graph of order n with a perfect matching. Then G is said to be k-extendable for 0 ? k ? n?2/2 if every matching in G of size k can be extended to a perfect matching. In this paper,
Sizhong Zhou, Yuli Zhang
semanticscholar   +1 more source

Some bounds for distance signless Laplacian energy-like invariant of networks

Carpathian Mathematical Publications
For a graph or network $G$, denote by $D(G)$ the distance matrix and $Tr(G)$ the diagonal matrix of vertex transmissions. The distance signless Laplacian matrix of $G$ is $D^{Q}(G)=Tr(G)+D(G)$.
A. Alhevaz, M. Baghipur, S. Pirzada, Y. Shang   +3 more
semanticscholar   +1 more source

Signless Laplacian spectrum of the cozero-divisor graph of the commutative ring ℤ𝑛

Georgian Mathematical Journal, 2023
Let 𝑅 be a commutative ring with identity 1 ≠ 0 1\neq 0 and let Z ⁢ ( R ) ′ Z(R)^{\prime} be the set of all non-zero and non-unit elements of ring 𝑅. Further, Γ ′ ⁢ ( R ) \Gamma^{\prime}(R) denotes the cozero-divisor graph of 𝑅, is an undirected graph ...
Mohd Rashid, M. Mozumder, Mohd Anwar
semanticscholar   +1 more source