Results 41 to 50 of about 4,425 (218)
Ice Lithography: Recent Progress Opens a New Frontier of Opportunities
This review focuses on recent advancements in ice lithography, including breakthroughs in compatible precursors and substrates, processes and applications, hardware, and digital methods. Moreover, it offers a roadmap to uncover innovation opportunities for ice lithography in fields such as biological, nanoengineering and microsystems, biophysics and ...
Bingdong Chang +9 more
wiley +1 more source
Pelabelan Graceful Satu Modulo Pada Beberapa Graf Eule [PDF]
. A graph with edges is said to be one modulo graceful graph () if there is a injective function from vertex set of graph to in such a way that induces a function from edge set of graph to defined as is bijective.
Isa, I. (Isa), Ratnasari, L. (Lucia)
core
A Note on 1-Edge Balance Index Set [PDF]
A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Varieties of graph labeling have been investigated by many authors [2], [3] [5] and they serve as useful models for broad range of ...
Chandrashekar Adiga, +2 more
core +1 more source
A Tracer Diffusion Study of Diverse Photo‐Ionic Phenomena in Strontium Titanate
Two strong interfacial photo‐ionic effects are demonstrated for the model system SrTiO3 through the application of isotope exchange experiments: UV illumination is found to enhance the oxygen surface exchange coefficient by several orders of magnitude and to depress the surface space‐charge potential substantially.
David M. Schwenkel +3 more
wiley +1 more source
On the Graceful Cartesian Product of Alpha-Trees
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
Two Rosa-type Labelings of Uniform k-distant Trees and a New Class of Trees [PDF]
A k-distant tree consists of a main path, called the spine, such that each vertex on the spine is joined by an edge to an end-vertex of at most one path on at most k vertices.
Wenger Diller, Kimberly
core +1 more source
Langford sequences and a product of digraphs [PDF]
Skolem and Langford sequences and their many generalizations have applications in numerous areas. The $\otimes_h$-product is a generalization of the direct product of digraphs. In this paper we use the $\otimes_h$-product and super edge-magic digraphs to
López, Susana-Clara +1 more
core +4 more sources
The Space Within: How Architected Voids Promote Tissue Formation
This review explores the role of void spaces in tissue engineering scaffolds and examines four key methods for introducing porosity into hydrogels at different scales. It discusses sacrificial templating, microgels, phase separation, and 3D printing, highlighting principles, advantages, and limitations. It also addresses emerging strategies integrating
Anna Puiggalí‐Jou +3 more
wiley +1 more source
Equitable Labelings of Caterpillar Graphs [PDF]
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
Materials and System Design for Self‐Decision Bioelectronic Systems
This review highlights how self‐decision bioelectronic systems integrate sensing, computation, and therapy into autonomous, closed‐loop platforms that continuously monitor and treat diseases, marking a major step toward intelligent, self‐regulating healthcare technologies.
Qiankun Zeng +9 more
wiley +1 more source

