Results 131 to 140 of about 41,123 (303)

Laser‐Induced Graphene from Waste Almond Shells

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

A PEG Construction of LDPC Codes Based on the Betweenness Centrality Metric

open access: yesAdvances in Electrical and Computer Engineering, 2016
Progressive Edge Growth (PEG) constructions are usually based on optimizing the distance metric by using various methods. In this work however, the distance metric is replaced by a different one, namely the betweenness centrality metric, which was ...
BHURTAH-SEEWOOSUNGKUR, I.   +2 more
doaj   +1 more source

Posets associated with subspaces in a d-bounded distance-regular graph [PDF]

open access: yes, 2009
Let Γ=(X,R) denote a d-bounded distance-regular graph with diameter d≥3. A regular strongly closed subgraph of Γ is said to be a subspace of Γ. For x∈X, let P(x) be the set of all subspaces of Γ containing x.
Jun Guo   +3 more
core   +1 more source

Swelling‐Programmed Topographical Guidance for Dynamic Spheroid Self‐Assembly via a Mechanochemical Hydrogel Niche

open access: yesAdvanced Functional Materials, EarlyView.
A swelling‐programmed micropatterned hydrogel guides adherent cells through a controlled transition from cell–matrix anchoring to cadherin‐mediated cell–cell compaction, enabling rapid assembly of high‐viability spheroids with defined size and morphology.
Han Gyeol Nam   +8 more
wiley   +1 more source

Three New Distance-regular Graphs

open access: yesEuropean Journal of Combinatorics, 1993
We describe three new diameter 4 distance-regular triple covers of strongly regular graphs. The first two such covers are distance- transitive, with intersection arrays \{416,315,64,1;1,32,315,416\} and \{56,45,16,1;1,8,45,56\}. The third has intersection array \{32,27,8,1;1,4,27,32\}, but is not distance-transitive.
openaire   +2 more sources

Intrinsic Photoactive Star ZnPc–Poly(glutamate) Nanoplatforms for Multimodal Glioblastoma Therapy and Brain‐Targeted Delivery

open access: yesAdvanced Functional Materials, EarlyView.
An intrinsic photoactive star‐shaped zinc phtalocyanine‐poly(L‐glutamic acid) (ZnPc‐PGA) nanoplatform for multimodal glioblastoma (GBM) therapy and brain‐targeted elivery. A ZnPc‐PGA‐based multifunctional theranostic nanocarrier platform enables image‐guided, multimodal GBM therapy. ZnPc‐PGA nanocarriers support the integration of fluorescence imaging,
Amina Benaicha‐Fernández   +14 more
wiley   +1 more source

Some Inequalities in Distance-Regular Graphs

open access: yesJournal of Combinatorial Theory, Series B, 1993
For integers \(r\) \((>0)\) and \(a\), let \(n_ r(a)\) denote the following value \[ n_ r(a)= 1+ a+ a(a- 1)+\cdots+ a(a-1)^ i+\cdots+ a(a-1)^ r. \] In this paper, we prove the following theorem and give several corollaries. Theorem. Let \(G\) be a distance-regular graph with girth \(g\) and diameter \(d\).
openaire   +2 more sources

Texoskeletons: Developing the Fundamental Technologies for Creating Intelligent Soft Robotic Clothing With Integrated 1D Sensors and Actuators

open access: yesAdvanced Functional Materials, EarlyView.
ABSTRACT Traditional wearable exoskeletons rely on rigid structures, which limit comfort, flexibility, and everyday usability. This work introduces the fundamental technologies to create the first soft, lightweight, intelligent textile‐based exoskeletons (Texoskeletons) built using 1D sensors and actuators.
Amy Lukomiak   +19 more
wiley   +1 more source

Digraph and Graph of Regular Rings with Some Properties

open access: yesمجلة بغداد للعلوم
During this century, a new research trend has emerged wherein algebraic concepts are combined with graph theory, such as zero divisors, clean rings, ideals, and regular rings.
Shahla Moayad Kaleel   +4 more
doaj   +1 more source

Distance-regular graphs of hamming type

open access: yesJournal of Combinatorial Theory, Series B, 1990
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

Home - About - Disclaimer - Privacy