Results 41 to 50 of about 1,315,432 (182)
Measures of centrality based on the spectrum of the Laplacian [PDF]
Physical Review E, 2012 We introduce a family of new centralities, the k-spectral centralities. k-Spectral centrality is a measurement of importance with respect to the deformation of the graph Laplacian associated with the graph. Due to this connection, k-spectral centralities have various interpretations in terms of spectrally determined information.
Pauls S., REMONDINI, DANIEL
openaire +4 more sources
A Surgery Result for the Spectrum of the Dirichlet Laplacian [PDF]
SIAM Journal on Mathematical Analysis, 2015 In this paper we give a method to geometrically modify an open set such that the first $k$ eigenvalues of the Dirichlet Laplacian and its perimeter are not increasing, its measure remains constant, and both perimeter and diameter decrease below a certain threshold. The key point of the analysis relies on the properties of the shape subsolutions for the
Bucur, Dorin +1 more
openaire +7 more sources
Spectrum of the Laplacian with weights [PDF]
Annals of Global Analysis and Geometry, 2018 Given a compact Riemannian manifold (M, g) and two positive functions $ρ$ and $σ$, we are interested in the eigenvalues of the Dirichlet energy functional weighted by $σ$, with respect to the L 2 inner product weighted by $ρ$. Under some regularity conditions on $ρ$ and $σ$, these eigenvalues are those of the operator $ρ$^{-1} div($σ$$\nabla$u) with ...
Bruno Colbois, Ahmad El Soufi
openaire +4 more sources
The sun graph is determined by its signless Laplacian spectrum [PDF]
, 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
On the cozero-divisor graphs associated to rings
AKCE International Journal of Graphs and Combinatorics, 2022 Let R be a ring with unity. The cozero-divisor graph of a ring R, denoted by [Formula: see text] is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of R, and two distinct vertices x and y are adjacent if and ...
Praveen Mathil +2 more
doaj +1 more source
New constructions of nonregular cospectral graphs
Special MatricesWe consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute ...
Hamud Suleiman, Berman Abraham
doaj +1 more source
The coalescence of multi-wheel and starlike graphs is DLS [PDF]
Journal of Mahani Mathematical ResearchThe Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum, it means that it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani +1 more
doaj +1 more source
The spectrum of the Laplacian for 1-forms [PDF]
Proceedings of the American Mathematical Society, 1974 Let ( M , g ) (M,g)
openaire +1 more source
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 +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
Trends in Computational and Applied Mathematics, 2021 We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source