Results 11 to 20 of about 2,064,253 (190)
The Laplacian spectrum of weighted composite networks and the applications
AIP AdvancesThe topological properties of the networks can be described by the Laplacian spectra, but resolving the Laplacian spectra of networks poses difficulties. In this study, a novel approach for solving the Laplacian spectrum of weighted composite networks is
Jian Zhu +3 more
doaj +2 more sources
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 D Q ( G ) = T r ( G ) + D ( G ) , where D ( G ) is the distance matrix of G and T r ( G
A. Alhevaz, M. Baghipur, E. Hashemi
semanticscholar +2 more sources
Concensus-Based ALADIN Method to Faster the Decentralized Estimation of Laplacian Spectrum
Applied Sciences, 2020 With the upcoming fifth Industrial Revolution, humans and collaborative robots will dance together in production. They themselves act as an agent in a connected world, understood as a multi-agent system, in which the Laplacian spectrum plays an important
Thi-Minh-Dung Tran +2 more
doaj +2 more sources
Complete split graph determined by its (signless) Laplacian spectrum
Discrete Applied Mathematics, 2016 Kinkar Ch Das, Muhuo Liu
exaly +2 more sources
On normalized Laplacian spectrum of zero divisor graphs of commutative ring ℤn
Electronic Journal of Graph Theory and Applications, 2021 For a finite commutative ring Zn with identity 1 6= 0, the zero divisor graph Γ(Zn) is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices x and y are adjacent if and only if xy = 0.
S. Pirzada +3 more
semanticscholar +1 more source
Cospectral constructions for several graph matrices using cousin vertices
Special Matrices, 2021 Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
Signless normalized Laplacian for hypergraphs
Electronic Journal of Graph Theory and Applications, 2022 The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
Eleonora Andreotti, Raffaella Mulas
doaj +1 more source
Laplacian energy and first Zagreb index of Laplacian integral graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul +2 more
doaj +1 more source
Theory and Applications of Graphs, 2021 In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent.
Dhiren Basnet, Ajay Sharma, Rahul Dutta
doaj +1 more source
Impact of Signal-to-Noise Ratio and Bandwidth on Graph Laplacian Spectrum From High-Dimensional Noisy Point Cloud [PDF]
IEEE Transactions on Information Theory, 2020 We systematically study the spectrum of kernel-based graph Laplacian (GL) constructed from high-dimensional and noisy random point cloud in the nonnull setup.
Xiucai Ding, Hau‐Tieng Wu
semanticscholar +1 more source