Results 91 to 100 of about 13,640 (282)
Image colorization by using graph bi-Laplacian
© 2019, Springer Science+Business Media, LLC, part of Springer Nature. Image colorization aims to recover the whole color image based on a known grayscale image (luminance or brightness) and some known color pixel values. In this paper, we generalize the
Li, Fang, Ng, Michael K.
core +1 more source
On the Spectra of Commuting and Non Commuting Graph on Dihedral Group
Study about spectra of graph has became interesting work as well as study about commuting and non commuting graph of a group or a ring. But the study about spectra of commuting and non commuting graph of dihedral group has not been done yet.
Abdussakir Abdussakir +2 more
doaj +1 more source
Minimizing the Determinant of the Graph Laplacian
ABSTRACTIn this paper, we study extremal values for the determinant of the weighted graph Laplacian under simple nondegeneracy conditions on the weights. We derive necessary and sufficient conditions for the determinant of the Laplacian to be bounded away from zero and for the existence of a minimizing set of weights. These conditions are given both in
Nathan Albin +3 more
openaire +2 more sources
Approximations of Metric Graphs by Thick Graphs and Their Laplacians [PDF]
The main purpose of this article is two-fold: first, to justify the choice of Kirchhoff vertex conditions on a metric graph as they appear naturally as a limit of Neumann Laplacians on a family of open sets shrinking to the metric graph (“thick graphs”) in a self-contained presentation; second, to show that the metric graph example is close to a ...
openaire +2 more sources
On structural controllability in complex networks with periodic switching topologies
Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Abstract Objective Surgical decision‐making in temporal lobe epilepsy (TLE) faces a critical challenge in determining whether the hippocampus can be safely spared during anterior temporal resection, particularly when surgery involves the language‐dominant hemisphere.
Guhan Seshadri NP +6 more
wiley +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
This study presents an inter‐material transfer learning framework for nanofluid heat transfer prediction in energy systems. By leveraging knowledge from Al2O3‐water data, the model accurately predicts hybrid Al2O3‐TiO2 nanofluid performance with only 20 simulations, achieving R2 = 0.985 and reducing computational requirements by 78. ABSTRACT This paper
Soumaya Hadj Salah +2 more
wiley +1 more source
Convolution operators and the discrete Laplacian
PhDIn this thesis, we obtain new results for convolution operators on homogeneous spaces and give applications to the Laplacian on a homogeneous graph. Some of these results have been published in joint papers [13, 14] with my supervisor.
Chen, Chung-Chuan
core
The graph p-Laplacian eigenvalue problem [PDF]
In this thesis we discuss the graph p-Laplacian eigenvalue problem. In particular, after reviewing the state of the art, we present new results on the nodal domain count of the p-Laplacian eigenpairs, on the graph infinity-Laplacian eigenproblem, and on ...
DEIDDA, PIERO
core

