Results 31 to 40 of about 13,640 (282)

On the second Laplacian spectral moment of a graph [PDF]

open access: yes, 1984
summary:Kragujevac (M. L. Kragujevac: On the Laplacian energy of a graph, Czech. Math. J. {\it 56}({\it 131}) (2006), 1207--1213) gave the definition of Laplacian energy of a graph $G$ and proved $LE(G)\geq 6n-8$; equality holds if and only if $G=P_n$.
Liu, Ying   +3 more
core   +1 more source

Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications

open access: yesAxioms, 2021
The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research.
Siti Nurul Fitriah Mohamad   +3 more
doaj   +1 more source

Graph Laplacian Learning with Exponential Family Noise. [PDF]

open access: yesIEEE Trans Signal Inf Process Netw
Graph signal processing (GSP) is a prominent framework for analyzing signals on non-Euclidean domains. The graph Fourier transform (GFT) uses the combinatorial graph Laplacian matrix to reveal the spectral decomposition of signals in the graph frequency ...
Shi C, Mishne G.
europepmc   +2 more sources

Duality and nonlinear graph Laplacians

open access: yesTheoretical Computer Science, 2018
We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/ε))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number of nonzero entries in the graph Laplacian $L$, $ε$ is the solution accuracy and $\tilde{O}()$ neglects (non-leading ...
Eric J. Friedman, Adam Scott Landsberg
openaire   +3 more sources

Signless Laplacian spectrum of power graphs of finite cyclic groups

open access: yesAKCE 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   +1 more source

Modified Graph Laplacian Model With Local Contrast and Consistency Constraint for Small Target Detection

open access: yesIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020
The traditional graph Laplacian model has been widely used in many computer vision tasks. The small target detection technique is one of the most challenging computer vision tasks in various practical applications.
Chaoqun Xia   +3 more
doaj   +1 more source

Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph

open access: yesComplexity, 2021
In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan   +3 more
doaj   +1 more source

On distance Laplacian spectrum of zero divisor graphs of the ring $\mathbb{Z}_{n}$

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
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

On the Seidel Laplacian spectrum of threshold graphs [PDF]

open access: yesJournal of Hyperstructures
A graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization
Megha P M, Parvathy K S
doaj   +1 more source

Some properties of the distance Laplacian eigenvalues of a graph [PDF]

open access: yes, 2014
summary:The distance Laplacian of a connected graph $G$ is defined by $\mathcal {L} = {\rm Diag(Tr)}- \mathcal {D}$, where $\mathcal {D}$ is the distance matrix of $G$, and ${\rm Diag(Tr)}$ is the diagonal matrix whose main entries are the vertex ...
Aouchiche, Mustapha, Hansen, Pierre
core   +1 more source

Home - About - Disclaimer - Privacy