Results 71 to 80 of about 107,087 (251)
Difluoromethylenation of Alkynes: Streamlined Access to Allyl Difluorides
Angewandte Chemie, EarlyView.Stabilizing primary oxocarbenium in HF/pyridine unlocks a direct alkyne difluoromethylenation – an efficient route to synthetically‐relevant allyl difluorides in a single step. ABSTRACT A direct difluoromethylenation of alkynes has been developed using HF/pyridine as a dual acidic and fluorinating medium. The reaction proceeds via in situ generation of
Fabien Naullet +4 more
wiley +2 more sources
On graceful labelings of trees
, 2018 We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
openaire +2 more sources
Graceful Labeling For bipartite graceful Graphs and related Graphs
, 2020 The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu, Chunfeng +2 more
openaire +2 more sources
Towards the Graceful Tree Conjecture: A Survey
, 2008 A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,..., n} such that the induced edge labels are all distinct.
Helen Giggins +2 more
core
From Artificial to Embodied and Physical Intelligence in Smart Manufacturing
Advanced Science, EarlyView.Smart manufacturing is reframed through complementary artificial, embodied, and physical intelligence, spanning computational reasoning, perception‐action coupling, and material‐level adaptation. Their integration across design, fabrication, operation, and maintenance reveals how intelligence can be co‐designed across algorithms, embodied agents, and ...
Kang Wang +9 more
wiley +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Entropy (Basel), 2023 Zhao M, Wang H, Yao B.
europepmc +1 more source
An Adiabatic Quantum Algorithm for Determining Gracefulness of a Graph
, 2017 Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph G with e edges, is to label the vertices of G with 0, 1, ℒ, e such that, if we specify to each edge the difference value between its two ends,
Shahrooz Janbaz +3 more
core +1 more source
On the Role of Preprocessing and Memristor Dynamics in Reservoir Computing for Image Classification
Advanced Electronic Materials, EarlyView.ABSTRACT Reservoir computing (RC) is an emerging recurrent neural network architecture that has attracted growing attention for its low training cost and modest hardware requirements. Memristor‐based circuits are particularly promising for RC, as their intrinsic dynamics can reduce network size and parameter overhead in tasks such as time‐series ...
Rishona Daniels +4 more
wiley +1 more source
Lucas Graceful Labeling For Some Graphs
, 2011 By a graph, we mean a finite undirected graph without loops or multiple edges.
Perumal, M. A. +2 more
openaire +3 more sources
Graceful centers of graceful graphs and universal graceful graphs
, 2019 In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph.
Makadia, H. M. +2 more
core +1 more source