Results 221 to 230 of about 9,253 (248)
When does global attention help: a unified empirical study on atomistic graph learning. [PDF]
J CheminformChowdhury A, Pasini ML.
europepmc +1 more source
Research on optimized multi-exposure image fusion method for improving information entropy in high-brightness region: Based on developing grayscale feature weight matrix. [PDF]
PLoS OneQu D, Lin Y.
europepmc +1 more source
Multi-scale covariance filtering for edge-preserving medical image fusion. [PDF]
Sci RepSharma S, Rani S, Dogra A, Shabaz M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On energy and Laplacian energy of chain graphs
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdullah Alazemi +2 more
exaly +3 more sources
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mustapha Aouchiche +2 more
exaly +3 more sources
On energy and Laplacian energy of bipartite graphs
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman +2 more
exaly +3 more sources
On the distance Laplacian energy ordering of a tree
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hilal A Ganie
exaly +3 more sources
Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm
International Journal of Foundations of Computer Science, 2015In spectral graph theory, the Laplacian energy of undirected graphs has been studied extensively. However, there has been little work yet for digraphs. Recently, Perera and Mizoguchi (2010) introduced the directed Laplacian matrix [Formula: see text] and directed Laplacian energy [Formula: see text] using the second spectral moment of [Formula: see ...
Xingqin Qi +4 more
openaire +1 more source
On the Laplacian energy of a graph
Czechoslovak Mathematical Journal, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Laplacian Energy of a Graph with Self-Loops
Match Communications in Mathematical and in Computer Chemistry, 2023Summary: The purpose of this paper is to extend the concept of Laplacian energy from simple graph to a graph with self-loops. Let \(G\) be a simple graph of order \(n\), size \(m\) and \(G_S\) is the graph obtained from \(G\) by adding \(\sigma\) self-loops.
Anchan, Deekshitha Vivek +3 more
openaire +2 more sources