Results 121 to 130 of about 11,443 (267)

Synthesis and Thermolysis of Ylidyl‐Substituted Stannylenes

Zeitschrift für anorganische und allgemeine Chemie, EarlyView.
The synthesis of an amino(ylidyl)stannylene is reported. The title compound was characterized via X‐ray diffraction and features a Sn2C2 heterocycle. Thermal treatment of the stannylene leads to the elimination of the amine. The products of the thermolysis are discussed.
Pascal Weisenburger, Emily Bitzer, Christopher E. Anson, Frank Breher   +3 more
wiley   +1 more source

Image and video analysis using graph neural network for Internet of Medical Things and computer vision applications

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, Ashutosh Sharma, Alexey Tselykh, Alexander Bozhenyuk, Byung‐Gyu Kim   +4 more
wiley   +1 more source

Global existence, asymptotic behavior, and finite time blow up of solutions for a class of generalized thermoelastic system with p-Laplacian

Advances in Nonlinear Analysis
In this work, we examine the initial boundary value problem for the thermoelastic system with pp-Laplacian, subject to a novel nonlinearity condition within a bounded domain.
Chen Yuxuan
doaj   +1 more source

On Radenković and Gutman conjecture for some classes of trees of diameter 5

Electronic Journal of Graph Theory and Applications
The Radenković and Gutman conjecture establishes a relationship between the Laplacian energies of any tree Tn, the star graph Sn and the path graph Pn, i.e., LE(Pn) ≤ LE(Tn) ≤ LE(Sn).
Afeefa Maryam, M. Tariq Rahim, Fawad Hussain   +2 more
doaj   +1 more source

Bounds for the signless laplacian energy

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Gutman, I., Robbiano, M., Cardoso, Domingos M., Abreu, N., Martins, E. A.   +4 more
core  

Enhancing generalized spectral clustering with embedding Laplacian graph regularization

CAAI Transactions on Intelligence Technology, EarlyView.
Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang, Jian Yang, Bob Zhang, Yang Tang, Wenli Du, Bihan Wen   +5 more
wiley   +1 more source

On spectrum and energies of enhanced power graphs

Mathematics Open
The enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj   +1 more source

New upper bounds for Laplacian energy [PDF]

, 2009
We obtain upper bounds and Nordhaus-Gaddum-type results for the Laplacian energy.
Bo Zhou
core  

Short‐Term Multi‐Horizon Line Loss Rate Forecasting of a Distribution Network Using Attention‐GCN‐LSTM

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Accurately predicting line loss rates is crucial for effective management in distribution networks, particularly for short‐term multihorizon forecasts ranging from 1 hour to 1 week. In this study, we propose attention‐GCN–LSTM, a novel method that integrates graph convolutional networks (GCN), long short‐term memory (LSTM) and a three‐level ...
Jie Liu, Yijia Cao, Yong Li, Yixiu Guo, Wei Deng   +4 more
wiley   +1 more source

Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph

, 2010
The energy of a graph G is defined as the sum of the singular values of its adjacency matrix and the Laplacian energy of G is defined as the sum of the distance between Laplacian eigenvalues and average degree of G.
Zhongzhu Liu
core