Results 81 to 90 of about 1,000,377 (259)
On graceful colorings of trees [PDF]
Mathematica Bohemica, 2017 A proper coloring $c V(G)\to\{1, 2,\ldots, k\}$, $k\ge2$ of a graph $G$ is called a graceful $k$-coloring if the induced edge coloring $c' E(G) \to\{1, 2, \ldots, k-1\}$ defined by $c'(uv)=|c(u)-c(v)|$ for each edge $uv$ of $G$ is also proper.
Sean English, Ping Zhang
doaj +1 more source
CLRe: A Synergistic Dual‐Engine Framework for One‐Step Retrosynthesis Prediction
Advanced Science, EarlyView.CLRe uses a contrastive difficulty score to order pretrained seq2seq fine‐tuning for retrosynthesis. Reaction embeddings define the ranking score, and a cumulative easy‐to‐hard schedule expands from the easiest subset to the full training set while earlier examples remain active.
Tianhao Su +5 more
wiley +1 more source
Parametric design method of building structured cabling system oriented to data mining
IET Networks, EarlyView., 2022 This paper puts forward the method of secondary development and design software through the research of building structured cabling system (SCS), and uses data mining technology to carry out parametric design of building SCS. Then, the feasibility of the design is tested by comparing the data of the traditional design and the parametric design ...
Bing Wang, Wei Yue
wiley +1 more source
On the graceful polynomials of a graph. [PDF]
Australas. J Comb., 2019 Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices. These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a basic tool, in some cases, for proving that a graph is non-graceful, and for generating a possibly ...
openaire +1 more source
Advanced Electronic Materials, EarlyView.This paper reviews the physics of liquid metals in RF devices, including the influence of mechanical strain on resonance as well as fabrication methods and strategies for designing tunable and strain‐tolerant inductors, capacitors, and antennas.
Md Saifur Rahman, William J. Scheideler
wiley +1 more source
Alpha graphs with different pendent paths
Electronic Journal of Graph Theory and Applications, 2020 Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existence of ...
Christian Barrientos
doaj +1 more source
Graceful Labelling of Edge Amalgamation of Cycle Graph
Journal of Physics: Conference Series, 2018 There are various topics in graph theory. The theory of labelling is one of the topics in graph theory. The theory of labelling was introduced firstly by Alex Rosa in 1967.
D. E. Nurvazly, K. Sugeng
semanticscholar +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
AgriFood: Journal of Agricultural Products for Food, EarlyView.Methyl salicylate and sorbitol were taken as coating agents. Caenorhabditis elegans was taken as an animal model. The coated agents were applied in C. elegans. The life span study in C. elegans proves the authenticity of MS and SL. MS and SL extended the post‐harvest life of cucumber for 14 days.
Chirayu H. Trivedi +3 more
wiley +1 more source
A PROCEDURE FOR DERIVING ODD-GRACEFUL CHROMATIC NUMBERS OF GRAPHS
Ural Mathematical JournalLet \(G:=(V,E)\) be an undirected finite simple graph with vertex set \(V\) and edge set \(E\). A function \(c:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\), such that \(c(u)\neq c(v)\) for every edge \(uv\in E(G)\), is called a ...
I Nengah Suparta +3 more
doaj +1 more source