Results 81 to 90 of about 39,337 (267)
A combinatorial library of dual‐functional antiviral oligomers incorporating N‐halamine and quaternary ammonium functionalities is developed for long‐lasting antiviral activity. The lead materials exhibit rapid and durable antiviral activity against SARS‐CoV‐2 variants and influenza H1N1, with 4 to 5 log reduction in viral copies at 5 mg mL−1 ...
Eid Nassar‐Marjiya +14 more
wiley +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
Shortest Paths in Distance-regular Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bendito, Enrique +2 more
openaire +2 more sources
MOFs and COFs in Electronics: Bridging the Gap between Intrinsic Properties and Measured Performance
Metal‐organic frameworks (MOFs) and covalent organic frameworks (COFs) hold promise for advanced electronics. However, discrepancies in reported electrical conductivities highlight the importance of measurement methodologies. This review explores intrinsic charge transport mechanisms and extrinsic factors influencing performance, and critically ...
Jonas F. Pöhls, R. Thomas Weitz
wiley +1 more source
On comparison between the distance energies of a connected graph
Let G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie +2 more
doaj +1 more source
On regular handicap graphs of order $n \equiv 0$ mod 8
A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, …, n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1), w(x2)
Dalibor Froncek, Aaron Shepanik
doaj +1 more source
Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this paper, we classify all commutative weakly distance-regular digraphs whose underlying graphs are Johnson ...
Yang, Yuefeng, Zeng, Qing, Wang, Kaishun
openaire +3 more sources
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source
Distance-regular graphs of hamming type
An H(e,\(\lambda\),k)-graph is defined to be a distance-regular graph with the following intersection array \[ \left\{\begin{matrix} 0 & 1 & 2 &... & e-1 & e & *...* \\ 0 & \lambda & 2\lambda & ... & (e-1)\lambda & * & *...* & \\ k & * & * & ... & * & * & *...* \end{matrix}\right\} \] where * takes an arbitrary value under the restriction that each ...
openaire +2 more sources
We introduce a nucleic acid nanoparticle (NANP) platform designed to be rrecognized by the human innate immune system in a regulated manner. By changing chemical composition while maintaining constant architectural parameters, we identify key determinants of immunorecognition enabling the rational design of NANPs with tunable immune activation profiles
Martin Panigaj +21 more
wiley +1 more source

