Results 21 to 30 of about 5,819 (125)
Effects of duplication operations on signless laplacian spectrum and network measures
This article investigates the spectral properties of graphs under vertex and edge duplication, analyzing how these operations affect the eigenvalues of Signless Laplacian operators. We derive the spectra for graphs with duplicated vertices and edges, and
Fareeha Hanif, Ali Raza
semanticscholar +2 more sources
On the Laplacian and signless Laplacian spectrum of a graph with k pairwise co-neighbor vertices
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. Abreu +3 more
semanticscholar +6 more sources
Signless Laplacian spectrum of power graph of certain finite non-commutative groups
In this present study, we investigate the signless Laplacian spectrum of power graphs of different finite non-commutative groups. Initially, we obtain the spectrum of the signless Laplacian matrix of power graph of elementary abelian groups whose orders ...
Subarsha Banerjee
semanticscholar +2 more sources
Bounds of signless Laplacian spectrum of graphs based on the k-domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqing Liu, Mei Lu
semanticscholar +2 more sources
On the reduced signless Laplacian spectrum of a degree maximal graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. Tam, Shu-hui Wu
semanticscholar +2 more sources
Graphs determined by signless Laplacian spectra
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning.
Ali Zeydi Abdian +2 more
doaj +2 more sources
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +2 more sources
Two graphs are said to be Q-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple graph with the same ...
Ye Jiachang, Qian Jianguo, Stanić Zoran
doaj +2 more sources
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +1 more source
Spectrum of Signless 1-Laplacian on Simplicial Complexes [PDF]
We introduce the signless 1-Laplacian and the dual Cheeger constant on simplicial complexes. The connection of its spectrum to the combinatorial properties like independence number, chromatic number and dual Cheeger constant is investigated. Our estimates can be comparable to Hoffman's bounds on Laplacian eigenvalues of simplicial complexes.
Xin Luo, Dong Zhang
openaire +2 more sources

