Results 1 to 10 of about 1,309,008 (158)
On distance signless Laplacian spectrum and energy of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2018 The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +7 more sources
Signless Laplacian spectrum of power graphs of finite cyclic groups [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj +3 more sources
On Some Forests Determined by Their Laplacian or Signless Laplacian Spectrum
Computers and Mathematics With Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zoran Stanić, Slobodan K Simić
exaly +5 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
Journal of Mathematics, 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
doaj +5 more sources
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +2 more sources
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 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 +3 more sources
Complete Split Graph Determined by Its (Signless) Laplacian Spectrum
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhuo Liu, Kinkar Chandra Das
exaly +2 more sources
Graphs determined by signless Laplacian spectra
AKCE International Journal of Graphs and Combinatorics, 2020 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
IEEE AccessExploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza +3 more
doaj +3 more sources
Eigenvalue Characterizations for the Signless Laplacian Spectrum of Weakly Zero-Divisor Graphs on
MathematicsLet R be a commutative ring with identity 1≠0. The weakly zero-divisor graph of R, denoted WΓ(R), is the simple undirected graph whose vertex set consists of the nonzero zero-divisors of R, where two distinct vertices a and b are adjacent if and only if ...
Nazim, Alaa Altassan, Nof T. Alharbi
doaj +2 more sources