Results 141 to 150 of about 1,379,256 (326)
Lobsters with an almost perfect matching are graceful [PDF]
, 2014 Let $T$ be a lobster with a matching that covers all but one vertex.
Krop, Elliot
core
On graceful difference labelings of disjoint unions of circuits
Open Journal of Discrete Applied Mathematics, 2019 A graceful difference labeling (gdl for short) of a directed graph G with vertex set V is a bijection f between V and {1,...,|V|} such that, when each arc uv is assigned the difference label f(v)-f(u), the resulting arc labels are distinct. We conjecture that all disjoint unions of circuits have a gdl, except in two particular cases.
Hertz, Alain, Picouleau, Christophe
openaire +4 more sources
4−Equitable Tree Labelings [PDF]
, 2017 We assign the labels {0,1,2,3} to the vertices of a graph; each edge is assigned the absolute difference of the incident vertices’ labels. For the labeling to be 4−equitable, we require the edge labels and vertex labels to each be distributed as ...
Coles, Zena +3 more
core +2 more sources
Angewandte Chemie International Edition, Accepted Article.This review explores the potential of mechanochemistry in the late‐stage modification of active pharmaceutical ingredients (APIs), offering a comprehensive analysis of methods designed to transform structurally complex molecular scaffolds. By examining the scope, efficiency, and mechanistic aspects of these approaches, the review highlights protocols ...
Johanna Templ, Lars Borchardt
wiley +1 more source
Angewandte Chemie International Edition, EarlyView.A novel concept for catalytic asymmetric 1,3‐dipolar cycloadditions with iminoesters employs modular polyfunctional Lewis acid/azolium‐aryloxide betaine catalysts, controlling endo‐ and exo‐selectivity through adjustments of metal center, azolium, and sterics.
Adrian Bürstner +13 more
wiley +1 more source
Graceful labeling of triangular extension of complete bipartite graph
Electronic Journal of Graph Theory and Applications, 2019 For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ⊙ K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n.
Sarbari Mitra, Soumya Bhoumik
doaj +1 more source
Graceful Labellings of Various Cyclic Snakes
, 2020 19 ...
Alkasasbeh, Ahmad H., Dyer, Danny
openaire +2 more sources
Quantitative Analysis of Fluorescent Sensor Arrays
Analysis &Sensing, EarlyView.Fluorescent sensor arrays have great potential for the quantification of analytes in complex systems. Herein, statistical multivariate techniques and deep learning models to provide quantitative information from such arrays are reviewed. Fluorescent sensor arrays address the limitations of a single sensor by leveraging multiple sensing elements to ...
Karandeep Grover +3 more
wiley +1 more source
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
The Domus Nozze D'Argento in Pompeii: Structural Diagnosis Using Geophysical Methods
Archaeological Prospection, EarlyView.ABSTRACT Monitoring of ancient buildings is an issue of great interest in view of a proper restoration. This paper describes the noninvasive monitoring of the Domus Nozze D'Argento in Pompeii. The Roman house, as occurred for many other buildings in Pompei, was buried in the ash from the 79 ad eruption of Mount Vesuvius.
Nicola Masini +4 more
wiley +1 more source