Results 71 to 80 of about 577,160 (277)
Some results on one type of graph family with some special number sequences
In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order ...
Emrullah Kirklar +2 more
doaj +1 more source
This study examines how pore shape and manufacturing‐induced deviations affect the mechanical properties of 3D‐printed lattice materials with constant porosity. Combining µ‐CT analysis, FEM, and compression testing, the authors show that structural imperfections reduce stiffness and strength, while bulk material inhomogeneities probably enhance ...
Oliver Walker +5 more
wiley +1 more source
Generalized Matching Preclusion in Bipartite Graphs
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler +4 more
doaj +1 more source
Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices
Zagreb indices and their modified versions of a molecular graph are important molecular descriptors which can be applied in characterizing the structural properties of organic compounds from different aspects. In this article, by exploring the structures
Jianwei Du, Xiaoling Sun
doaj +1 more source
Determinants and perfect matchings
15 pages, terminology improved, exposition tightened, "deranged matchings" example ...
openaire +4 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
A unidirectional cerebral organoid–organoid neural circuit is established using a microfluidic platform, enabling controlled directional propagation of electrical signals, neuroinflammatory cues, and neurodegenerative disease–related proteins between spatially separated organoids.
Kyeong Seob Hwang +9 more
wiley +1 more source
A note on arbitrarily vertex decomposable graphs [PDF]
A graph \(G\) of order \(n\) is said to be arbitrarily vertex decomposable if for each sequence \((n_{1},\ldots,n_k)\) of positive integers such that \(n_{1}+\ldots+n_{k}=n\) there exists a partition \((V_{1},\ldots,V_{k})\) of the vertex set of \(G ...
Antoni Marczyk
doaj
Optimum matchings in weighted bipartite graphs [PDF]
Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum weight perfect
C. Vargas, Carlos E. Valencia, Marcos
core
An All‐Optical Driven Bio‐Photovoltaic Interface for Active Control of Live Cells
Bio‐photovoltaic Interface (BIO‐PV‐I) for live cell manipulation is presented. BIO‐PV‐I can be activated non‐invasively and remotely to control the spatial motility, adhesion, and morphology of cells adhering to it. BIO‐PV‐I uses a patterned light‐induced electric potential in iron‐doped lithium niobate crystals whose light‐driven and reversible nature,
Lisa Miccio +8 more
wiley +1 more source

