Results 121 to 130 of about 1,309,008 (158)
Bounds for the signless laplacian energy
The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Gutman, I. +4 more
core
Spectral energies of redefined Zagreb indices and comparative QSPR applications to anticancer and alcohol datasets. [PDF]
Sci RepZeren Y, Çiçek E, Alsharafi M.
europepmc +1 more source
On relations between structural invariants of graphs and the signless Laplacian spectrum
, 2013 In the last five years, much attention was devoted to the signless Laplacian of a graph by the scientific community. One of the main reasons for this interest is the intuition, shared by many researchers on the basis of studies concerning small graphs, that more graphs are determined by their signless Laplacian spectrum than by those of the adjacency ...
openaire +1 more source
Further results on the distance signless Laplacian spectrum of graphs
Asian-European Journal of Mathematics, 2018 The distance signless Laplacian matrix [Formula: see text] of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix whose main entries are the vertex transmissions of [Formula: see text], and the spectral radius of ...
Alhevaz, Abdollah +2 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Distance signless Laplacian spectrum of a graph
Frontiers of Mathematics in China, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia, Huicai, Shiu, Wai Chee
openaire +2 more sources
On the signless Laplacian spectrum of the comaximal graphs
Asian-European Journal of Mathematics, 2022Assume that [Formula: see text] is a commutative ring with nonzero identity. The comaximal graph of [Formula: see text], denoted by [Formula: see text], is a simple graph whose vertex set consists of all elements of [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]
Afkhami, Mojgan +2 more
openaire +2 more sources
On the Distance Signless Laplacian Spectrum of Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alhevaz, A. +3 more
openaire +2 more sources
The signless Laplacian spectrum of rooted product of graphs
Discrete Mathematics, Algorithms and Applications, 2018Let [Formula: see text] be a simple graph with [Formula: see text] vertices and [Formula: see text] be a sequence of [Formula: see text] rooted graphs [Formula: see text]. The rooted product [Formula: see text], of [Formula: see text] by [Formula: see text] is constructed by identifying the root vertex of [Formula: see text] with the [Formula: see ...
Maryam Maghsoudi, Abbas Heydari
openaire +3 more sources
On the signless Laplacian and normalized Laplacian spectrum of the zero divisor graphs
Ricerche di Matematica, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Afkhami, Mojgan +2 more
openaire +1 more source
On distance signless Laplacian spectrum of the complements of unicyclic graphs and trees
Linear Algebra and its Applications, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuanjing Li, Rui Qin, Dan Li
openaire +2 more sources