Results 181 to 190 of about 62,697 (198)

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

Presenting Antimicrobial Peptides on Poly(ethylene glycol): Star-Shaped vs Comb-Like Architectures. [PDF]

open access: yesMacromolecules
Cui Z   +6 more
europepmc   +1 more source

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

Edge Metric Dimension of Comb Product Cycles Versus Stars and Fans

Journal of Advanced Research in Applied Sciences and Engineering Technology
The edge metric dimension finding of a graph resulting from the comb product on a cycle graph to the complete graph and the fact about the dominant vertex in the complete graph arise a problem about the edge metric dimension of a graph resulting from the comb product on a cycle graph to the other graphs that have dominant vertex such as star and fan ...
Abdilla Nurul Azisah Mn   +2 more
openaire   +1 more source

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

On graceful chromatic number of comb product of ladder graph

Journal of Physics: Conference Series, 2021
Ridho Alfarisi, E R Albirri
exaly  

Home - About - Disclaimer - Privacy