Results 101 to 110 of about 1,379,256 (326)
Graceful labeling on a multiple-fan graph with pendants
, 2021 An injective function f from the set of vertices in a graph G to a set {0,1,…,n} is called graceful labeling if the function f induced the edge function f* from the set of edges of G to a set of positive integers {1,2,…,n} with f*(xy) = |f(x) − f(y)| for
A. Akerina, K. Sugeng
semanticscholar +1 more source
State‐of‐the‐Art, Insights, and Perspectives for MOFs‐Nanocomposites and MOF‐Derived (Nano)Materials
Advanced Materials, EarlyView.Different approaches to MOF‐NP composite formation, such as ship‐in‐a‐bottle, bottle‐around‐the‐ship and in situ one‐step synthesis, are used. Owing to synergistic effects, the advantageous features of the components of the composites are beneficially combined, and their individual drawbacks are mitigated.
Stefanos Mourdikoudis +6 more
wiley +1 more source
Designing Physical Unclonable Functions From Optically Active Materials
Advanced Materials, EarlyView.Assigning unforgeable “fingerprints” to manufactured goods is a key strategy to fight global counterfeiting. Optical physical unclonable functions (PUFs) are chemically generated random patterns of optically active materials serving as unique authenticators.
Maxime Klausen +2 more
wiley +1 more source
Tailoring Robust Quantum Anomalous Hall Effect via Entropy‐Engineering
Advanced Materials, EarlyView.Bandstructure renormalization, without (w/o) spin‐orbit interaction (SOI) (left) and with SOI (right), in the low‐energy Dirac bands of zero‐entropy (purple) and entropic (green) VCl3 monolayer (ML) with long‐range ordering (LRO). Abstract The development of quantum materials and the tailoring of their functional properties is of fundamental interest ...
Syeda Amina Shabbir +3 more
wiley +1 more source
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
Advanced Materials, EarlyView.We report a 3.2 Å cryoEM structure of functional amyloid protein FapC from Pseudomonas sp. UK4, an essential component of bacterial biofilm, which reveals a Greek key‐shaped protofilament, supports bioinformatically determined motifs, nuances AlphaFold predictions, emphasizes heterogeneous cross‐β stacking in amyloid cross‐seeding and shows strain ...
Yanting Jiang +13 more
wiley +1 more source
On the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs, 2017 A \emph{graceful labeling} of a graph $G$ of size $n$ is an injective assignment of integers from the set $\{0,1,\dots,n\}$ to the vertices of $G$ such that when each edge has assigned a \emph{weight}, given by the absolute value of the difference of the
Christian Barrientos, Sarah Minion
doaj +1 more source
A Study on Integer Additive Set-Graceful Graphs [PDF]
, 2015 A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow \mathcal{P}(X)-\{\emptyset\}$ defined by $f^
Germina, K. A., Sudev, N. K.
core
Functionalized Antifouling Polymer Brushes for Biospecific Surfaces
Advanced Materials Interfaces, EarlyView.Modern biosensors offer high sensitivity but often struggle with long‐term stability and selectivity for specific targets. Antifouling polymer brushes help enhance both stability and selectivity. In this review, we compare recent antifouling coatings, their design parameters, and how they are integrated with biorecognition elements for improved ...
Erik J. Postma +4 more
wiley +1 more source
Equitable Labelings of Caterpillar Graphs [PDF]
, 2012 The Graceful Tree Conjecture in graph theory has been open for almost half a century. The conjecture states that the vertices of any tree can be labeled with distinct integers between 0 and the number of edges of the tree in a way that the edges can be ...
Burek, Mark +2 more
core +2 more sources