Results 41 to 50 of about 76,384 (242)
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
, 2017 Inverse imaging problems are inherently under-determined, and hence it is important to employ appropriate image priors for regularization. One recent popular prior---the graph Laplacian regularizer---assumes that the target pixel patch is smooth with ...
Cheung, Gene, Pang, Jiahao
core +2 more sources
The Laplacian spread of graphs [PDF]
Czechoslovak Mathematical Journal, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
You, Zhifu, Liu, Bolian
openaire +2 more sources
Spectral convergence of non-compact quasi-one-dimensional spaces
, 2006 We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and the ...
Post, Olaf
core +1 more source
Integral Laplacian graphs with a unique repeated Laplacian eigenvalue, I
Special Matrices, 2023 AbstractThe setSi,n={0,1,2,…,n−1,n}\{i}{S}_{i,n}=\left\{0,1,2,\ldots ,n-1,n\right\}\setminus \left\{i\right\},1⩽i⩽n1\leqslant i\leqslant n, is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum isSi,n{S}_{i,n}. The existence of such graphs was established by Fallat et al.
Hameed Abdul, Tyaglov Mikhail
openaire +5 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
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 +1 more source
The Laplacian Eigenvalues and Invariants of Graphs
, 2014 In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues.
Pan, Rong-Ying +2 more
core +1 more source
Garden of Laplacian borderenergetic graphs
, 2021 Summary: Let \(G\) be a graph of order \(n\). \(G\) is said to be \(L\)-borderenergetic if its Laplacian energy is the same as the energy of the complete graph \(K_n\), i.e. \(LE(G)=2(n-1)\). In this paper, we construct 36 infinite classes of \(L\)-borderenergetic graphs.
Dede, Cahit, Maden, Ayse Dilek
openaire +2 more sources
Spectral properties of the commuting graphs of certain groups
AKCE International Journal of Graphs and Combinatorics, 2019 Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +1 more source
A nodal domain theorem and a higher-order Cheeger inequality for the graph $p$-Laplacian [PDF]
, 2016 We consider the nonlinear graph $p$-Laplacian and its set of eigenvalues and associated eigenfunctions of this operator defined by a variational principle. We prove a nodal domain theorem for the graph $p$-Laplacian for any $p\geq 1$. While for $p>1$ the
Hein, Matthias, Tudisco, Francesco
core +1 more source
The G-Invariant Graph Laplacian
, 2023 Graph Laplacian based algorithms for data lying on a manifold have been proven effective for tasks such as dimensionality reduction, clustering, and denoising. In this work, we consider data sets whose data points lie on a manifold that is closed under the action of a known unitary matrix Lie group G.
Rosen, Eitan +4 more
openaire +2 more sources