Results 161 to 170 of about 1,855 (182)

Enhancing Stability of Few‐Layer Black Phosphorus (FLBP) Through Nitrocellulose Coating: A Robust Defense Mechanism Against Degradation

open access: yesAdvanced Materials Interfaces, Volume 13, Issue 11, 9 June 2026.
In this research, a simple and scalable strategy for protection of a few‐layer black phosphorus (FLBP) with a cellulose nitrate‐based material is presented. The FLBP is structurally and morphologically characterized. The FLBP stability with and without nitrocellulose protection is monitored by interferometric method, surface profile examination, and ...
Paweł Jakóbczyk   +8 more
wiley   +1 more source

Validation and application of a visual LAMP assay for Mpox diagnosis - Insights from clinical samples in Thailand. [PDF]

open access: yesMethodsX
Jaroenram W   +5 more
europepmc   +1 more source

Progress in silicon-based reconfigurable and programmable all-optical signal processing chips. [PDF]

open access: yesFront Optoelectron
Xu J   +27 more
europepmc   +1 more source

A constructive method to determine the total vertex irregularity strength of two flower graph variants. [PDF]

open access: yesMethodsX
Hinding N   +6 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

On \(H\)-irregularity strength of comb and edge comb product of graphs

Journal of Combinatorial Mathematics and Combinatorial Computing
Let \(G\) and \(H\) be graphs and \(1\) be a positive number. An \(H\)-irregular labeling of \(G\) is an assignment of integers from \(1\) up to \(k\) to either vertices, edges, or both in \(G\) such that each sum of labels in a subgraph isomorphic to \(H\) are pairwise distinct.
Maryati, Tita Khalis   +1 more
exaly   +3 more sources

On a Tight Boundary of the Locating Rainbow Connection Numbers of the Edge-Comb Product of Several Graphs

Summary: We investigate the tight bounds of the locating rainbow vertex-connection number (RVCL) on the edge-comb product (ECP) of arbitrary pairs of graphs. Specifically, we present examples of graph pairs that attain the upper bound, as well as those that attain the lower bound.
Imrona, M.   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy