Results 131 to 140 of about 1,624,240 (288)
The spectrum of the Laplacian matrix of a balanced binary tree
Linear Algebra and its Applications, 2002 Let \(L({\mathcal B}_k)\) be the Laplacian matrix of an unweighted balanced binary tree \({\mathcal B}_k\) of \(k\) levels. The author completely characterizes the eigenvalues of \(L({\mathcal B}_k)\) by labelling vertices of \({\mathcal B}_k\) in such a way that \(L({\mathcal B}_k)\) becomes a symmetric persymmetric matrix.
openaire +4 more sources
Dy2 Schiff Base Single Molecule Magnet Forming a Halogen Bonding Network: Experiment and Theory
Zeitschrift für anorganische und allgemeine Chemie, EarlyView.A major challenge to improve SMMs is control over phonon‐based relaxation mechanisms, such as the Raman process. We approach this challenge through the incorporation of intermolecular interactions, which can restrict acoustic phonon modes. For this, we engineer the crystal lattice of a Dy2 SMM using halogen bonding and investigate its properties using ...
Jonas Braun +7 more
wiley +1 more source
Zeitschrift für anorganische und allgemeine Chemie, EarlyView.The isolation and solid‐state structures of the two disulfate‐containing pnictogenates [SeCl3][Pn(S2O7)2] (Pn = Sb, Bi), as well as the mixed‐anionic As2[S2O7]2[S3O10] are presented. The former two consist of complex ∞1{[Pn(S2O7)1/1t(S2O7)2/2e]‐}$$ {\infty }^{1}\left\{{\left[\mathrm{Pn}{\left({\mathrm{S}}_{2}{\mathrm{O}}_{7}\right)}_{1/1}^{\mathrm{t}}{\
Jan Langwald +5 more
wiley +1 more source
What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion
Special MatricesWe introduce an operator-theoretic definition of a proper graph Laplacian as any matrix associated with a given graph that can be expressed as the composition of a divergence and a gradient operator, with the gradient acting between graph-related spaces ...
Estrada Ernesto
doaj +1 more source
Laplacian matrix and distance in trees
Kragujevac journal of mathematics, 2004 Laplacian matrix and distance in trees.
Vukičević, Damir, Gutman, Ivan
openaire +1 more source
A note on a conjecture for the distance Laplacian matrix
, 2016 In this note, the graphs of order n having the largest distance Laplacian eigenvalue of multiplicity n −2 are characterized. In particular, it is shown that if the largest eigenvalue of the distance Laplacian matrix of a connected graph G of order n has ...
Marques da Silva, Celso +3 more
core +1 more source
Correction to: Robust joint clustering of multi-omics single-cell data via multi-modal high-order neighborhood Laplacian matrix optimization. [PDF]
Bioinformatics, 2023 europepmc +1 more source
Eigenvalues of the Laplacian matrix.
, 2014 First eigenvalues in ascending order of the normalized Laplacian matrix relative to the alignment of 2880 H. sapiens promoters. The method used is the Needleman–Wunsch with GAPOPEN and GAPEXTEND for panel A, GAPEXTEND for panel B.
Lucia Pettinato (512883) +4 more
core +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source
Multi-label feature selection based on dynamic graph Laplacian
Tongxin xuebao, 2020 In view of the problems that graph-based multi-label feature selection methods ignore the dynamic change of graph Laplacian matrix, as well as such methods employ logical-value labels to guide feature selection process and loses label information, a ...
Yonghao LI +3 more
doaj +2 more sources