Results 41 to 50 of about 79,461 (254)
On distance Laplacian spectrum of zero divisor graphs of the ring $\mathbb{Z}_{n}$
For a finite commutative ring $\mathbb{Z}_{n}$ with identity $1\neq 0$, the zero divisor graph $\Gamma(\mathbb{Z}_{n})$ 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
S. Pirzada, B.A. Rather, T.A. Chishti
doaj +1 more source
Some improved bounds on two energy-like invariants of some derived graphs
Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
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]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
You, Zhifu, Liu, Bolian
openaire +2 more sources
Signless Laplacian determinations of some graphs with independent edges
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj +1 more source
Blow-up in a p-Laplacian mutualistic model based on graphs
In this paper, we study a $ p\, $-Laplacian ($ p > 2 $) reaction-diffusion system based on weighted graphs that is used to describe a network mutualistic model of population ecology.
Ling Zhou, Zuhan Liu
doaj +1 more source
The Laplacian Eigenvalues and Invariants of Graphs
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
Integral Laplacian graphs with a unique repeated Laplacian eigenvalue, I
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
Spectral convergence of non-compact quasi-one-dimensional spaces
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
Garden of Laplacian borderenergetic graphs
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

