Results 71 to 80 of about 1,716,586 (315)
Perfect codes in quintic Cayley graphs on abelian groups [PDF]
, 2022 Yuefeng Yang, Xuanlong Ma, Zeng Qing
openalex +1 more source
Substrate Stress Relaxation Regulates Cell‐Mediated Assembly of Extracellular Matrix
Advanced Functional Materials, EarlyView.Silicone‐based viscoelastic substrates with tunable stress relaxation reveal how matrix mechanics regulates cellular mechanosensing and cell‐mediated matrix remodelling in the stiff regime. High stress relaxation promotes assembly of fibronectin fibril‐like structures, increased nuclear localization of YAP and formation of β1 integrin‐enriched ...
Jonah L. Voigt +2 more
wiley +1 more source
Franck-Condon factors by counting perfect matchings of graphs with loops. [PDF]
Journal of Chemical Physics, 2018 We show that the Franck-Condon Factor (FCF) associated with a transition between initial and final vibrational states in two different potential energy surfaces, having N and M vibrational quanta, respectively, is equivalent to calculating the number of ...
N. Quesada
semanticscholar +1 more source
Advanced Functional Materials, EarlyView.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
Le Matematiche, 1992 Let q be a positive integer. Many graphs admit a partial coloring with q colors and a clique partition such that each of the cliques is strongly colored, that is: contains the largest possible number of different colors.
Claude Berge
doaj
Characterization of perfect matching transitive graphs
Electronic Journal of Graph Theory and Applications, 2018 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-
Ju Zhou
doaj +1 more source
Perfect 2-colorings of the cubic graphs of order less than or equal to 10
AKCE International Journal of Graphs and Combinatorics, 2020 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . .
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source
On the choosability of claw-free perfect graphs
, 2015 It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is perfect.
Gravier, Sylvain +2 more
core +3 more sources
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
Advanced Functional Materials, EarlyView.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
Rainbow perfect domination in lattice graphs
Electronic Journal of Graph Theory and Applications, 2018 Let 0 < n ∈ Z. In the unit distance graph of Zn ⊂ Rn, a perfect dominating set is understood as having induced components not necessarily trivial.
Luis R. Fuentes +2 more
doaj +1 more source