Results 41 to 50 of about 836 (298)

Ice Lithography: Recent Progress Opens a New Frontier of Opportunities

open access: yesAdvanced Functional Materials, EarlyView.
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

A Tracer Diffusion Study of Diverse Photo‐Ionic Phenomena in Strontium Titanate

open access: yesAdvanced Functional Materials, EarlyView.
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

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

Block-Graceful Designs

open access: yesJournal of Mathematics, 2023
In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj   +1 more source

Graceful and Odd Graceful Labeling of Some Graphs

open access: yesInternational Journal of Mathematics and Soft Computing, 2013
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
N. H. Shah, S. K. Vaidya
openaire   +1 more source

4D Printing of Self‐Immolative Polymers

open access: yesAdvanced Functional Materials, EarlyView.
The integration of self‐immolative polymers (SIPs) into light‐based 3D printed structures is presented as a new “living” 4D printing strategy. By exploiting their metastability and stimuli‐responsiveness, SIP‐containing printed objects can undergo rapid and triggered degrowth under ambient conditions and subsequent regrowth through polymer ...
Johannes Markhart   +3 more
wiley   +1 more source

Edge Odd Graceful Labeling in Some Wheel-Related Graphs

open access: yesMathematics
A graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from the set
Mohammed Aljohani, Salama Nagy Daoud
doaj   +1 more source

On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One

open access: yesJournal of Applied Mathematics, 2016
A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four
A. Panpa, T. Poomsa-ard
doaj   +1 more source

On graphs with α- and b-edge consecutive edge magic labelings

open access: yesIndonesian Journal of Combinatorics, 2022
Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related.
Christian Barrientos
doaj   +1 more source

Home - About - Disclaimer - Privacy