Results 61 to 70 of about 3,180,841 (100)

On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph

open access: yes, 2022
Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$.
Pirzada, S., Khan, Saleem
core   +1 more source

New bounds on the distance Laplacian and distance signless Laplacian spectral radii

open access: yes, 2019
Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived.
Rojo, Óscar   +2 more
core   +1 more source

On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]

open access: yes, 2016
Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
core   +1 more source

The sun graph is determined by its signless Laplacian spectrum

open access: yes, 2010
For a simple undirected graph G, the corresponding signless Laplacian matrix is defined as D(G) + A(G) in which D(G) and A(G) are degree matrix and adjacency matrix of G, respectively.
Mirzakhah, Maryam, Kiani, Dariush
core   +1 more source

Eigenvalue-based entropy in directed complex networks. [PDF]

open access: yesPLoS One, 2021
Sun Y, Zhao H, Liang J, Ma X.
europepmc   +1 more source

Ordering cacti with signless Laplacian spread

open access: yes, 2018
A cactus is a connected graph in which any two cycles have at most one vertex in common. The signless Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the associated signless Laplacian
Lin, Zhen, Guo, Shu-Guang
core   +1 more source

A sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]

open access: yes, 2016
summary:We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance ...
Shu, Yujie, Zhang, Xiao-Dong, You, Lihua
core   +1 more source

Home - About - Disclaimer - Privacy