Results 121 to 130 of about 723,682 (282)
Pelabelan Prima pada Kelas Graf Hasil Operasi Perkalian Tensor
A graph with a vertex set is said to be a prime graph if there exists a bijective mapping , where denotes the number of vertices in , such that for any two adjacent vertices and in have . Tensor Product graph is a way to combine (compose)
Suci Triwahyuniti, Desi Rahmadani
doaj +1 more source
Weighted Szeged indices of some graph operations [PDF]
In this paper, the weighted Szeged indices of Cartesian product and Corona product of twoconnected graphs are obtained. Using the results obtained here, the weighted Szeged indices ofthe hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus ...
Kannan Pattabiraman, P. Kandan
doaj
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
Reciprocal degree distance of some graph operations [PDF]
The reciprocal degree distance (RDD), defined for a connected graph G as vertex-degreeweighted sum of the reciprocal distances, that is, RDD(G) = u,v∈PV(G) dG(u)+dG(v) dG(u,v) . The reciprocal degree distance is a weight version of the Harary index, just
Kannan Pattabiraman, M. Vijayaragavan
doaj
Charge transport in 2D tin perovskite FETs is shown to be governed by dielectric interface behavior. Polar polymer dielectrics induce dipolar disorder that localizes carriers, whereas nonpolar polymers suppress trapping and enable superior charge transport, ensuring stable and reliable transistor operation. ABSTRACT Understanding the role of interfaces
Chongyao Li +5 more
wiley +1 more source
On the harmonic index of graph operations [PDF]
The harmonic index of a connected graph G , denoted by H(G) , is defined as H(G)=∑ uv∈E(G) 2d u +d v where d v is the degree of a vertex v in G.
B. Shwetha Shetty +2 more
doaj
Microfluidic Modeling of Macrophage‐Induced Cardiac Inflammation Using NF‐κB Reporter Cardiomyocytes
A cardiac inflammation model was developed to enable real‐time analysis of macrophage‐cardiomyocyte interactions using NF‐κB‐reporter cardiomyocytes and a microfluidic co‐culture system. A MATLAB‐based model was implemented to optimize cell density and medium resupply based on TNFα diffusion kinetics. Activation thresholds and stress responses in NF‐κB‐
Chao Liu +6 more
wiley +1 more source
The distance Seidel matrix of connected graphs
For a connected graph G, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix [Formula: see text]. Suppose that the eigenvalues of [Formula: see text] be [Formula: see text] In this article,
T. Haritha, A. V. Chithra
doaj +1 more source
Pressure skin wounds are frequent complications after spinal cord injury (SCI), with impaired healing due to vascular and immune deficits. Elastin‐like polypeptides (ELP) fused to α‐MSH (MSH‐ELP) or MCP‐1 (MCP‐ELP) are developed and tested on these wounds. The resulting nanoparticles are non‐toxic and bioactive, and they enhance macrophage recruitment,
Suneel Kumar +7 more
wiley +1 more source
Operation-Based Notation for Archimedean Graph [PDF]
We introduce three graph operations corresponding to polyhedral operations. By applying these operations, thirteen Archimedean graphs can be generated from Platonic graphs that are used as seed graphs.
Hidetoshi Nonaka
doaj

