Results 111 to 120 of about 542,793 (319)
Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source
This study presents novel anti‐counterfeiting tags with multilevel security features that utilize additional disguise features. They combine luminescent nanosized Ln‐MOFs with conductive polymers to multifunctional mixed‐matrix membranes and powder composites. The materials exhibit visible/NIR emission and matrix‐based conductivity even as black bodies.
Moritz Maxeiner +9 more
wiley +1 more source
On Distance Magic Harary Graphs
This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for
Paramasivam, Krishnan, Prajeesh, A V
core
Shortest Paths in Distance-regular Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bendito, Enrique +2 more
openaire +2 more sources
The study presents biodegradable and recyclable mixed‐matrix membranes (MMMs), hydrogels, and cryogels using luminescent nanoscale metal‐organic frameworks (nMOFs) and biopolymers. These bio‐nMOF‐MMMs combine europium‐based nMOFs as probes for the status of the materials with the biopolymers agar and gelatine and present alternatives to conventional ...
Moritz Maxeiner +4 more
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
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
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

