Results 81 to 90 of about 1,379,256 (326)

Radio Graceful Hamming Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G).
Niedzialomski Amanda
doaj   +1 more source

Scaling‐Up of Structural Superlubricity: Challenges and Opportunities

open access: yesAdvanced Functional Materials, EarlyView.
At increasing length‐scales, structural superlubricity (SSL) faces challenges from physical and chemical energy dissipation pathways. This study reviews recent experimental and theoretical progress on these challenges facing the scaling‐up of SSL, as well as perspectives on future directions for realizing and manipulating macroscale superlubricity ...
Penghua Ying   +4 more
wiley   +1 more source

Machine Learning‐Enabled Polymer Discovery for Enhanced Pulmonary siRNA Delivery

open access: yesAdvanced Functional Materials, EarlyView.
This study provides an efficient approach to train a machine learning model by merging heterogeneous literature data to predict suitable polymers for siRNA delivery. Without the need for extensive laboratory synthesis, the machine learning enabled a virtual screening and successfully predicted a polymer that is validated for effective gene silencing in
Felix Sieber‐Schäfer   +10 more
wiley   +1 more source

Pelabelan Graceful pada Digraf Lintasan dan Digraf Bipartit Lengkap [PDF]

open access: yes, 2008
A graceful labeling of digraph is a one to one function------ --------------------------- s­­­­­­­uch­­­ that each arc in D is labeled with , the re­­sulting arc labels are distinct.
Fatekurohman, M. (M)   +2 more
core  

Skolem graceful labeling of Lobster graph Ln(2,r)

open access: yes, 2021
Let G be a finite simple graph with vertex set V(G) and edge set (G). A skolem graceful labeling of G is an injective function f: V(G) → {1, 2, 3, …, |V(G)|} such that the induced labeling f’: E(G) → {1, 2, 3, …, |E(G) |} defined by f’(uv) = |f(u) - f(v)|
Dwi Aruma Urnika, Purwanto
semanticscholar   +1 more source

Transmembrane Activation of Catalysis and Protein Refolding in Synthetic Cells by Enzymes and Nanozymes

open access: yesAdvanced Functional Materials, EarlyView.
Synthetic cells are engineered herein to respond to an external chemical messenger by the activation of intracellular catalysis. The chemical messenger molecules are catalytically generated by an extracellular enzyme or a mineral surface, whereas the intracellular catalysis emerges via direct enzyme activation or via protein refolding.
Dante G. Andersen   +5 more
wiley   +1 more source

Pelabelan Super Graceful Untuk Beberapa Graf Khusus [PDF]

open access: yes, 2012
Given a graph , super graceful labeling is bijective function such that for every edge .
Anjani, P. T. (Primas)   +1 more
core  

Graceful and Odd Graceful Labeling of Graphs

open access: yesInternational Journal of Mathematics and Soft Computing, 2016
In this paper we prove gracefulness and odd gracefulness of arbitrary super -subdivision of triangular snake, where labeling of the vertices follows arithmetic progression.
openaire   +2 more sources

Understanding Functional Materials at School

open access: yesAdvanced Functional Materials, EarlyView.
This review outlines strategies for effectively teaching nanoscience in schools, focusing on challenges such as scale comprehension and curriculum integration. Emphasizing inquiry‐based learning and chemistry core concepts, it showcases hands‐on activities, digital tools, and interdisciplinary approaches.
Johannes Claußnitzer, Jürgen Paul
wiley   +1 more source

Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs

open access: yesTheory and Applications of Graphs, 2020
In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj   +1 more source

Home - About - Disclaimer - Privacy