Results 91 to 100 of about 64,345 (264)

Oriented Chromatic Number of Cartesian Products and Strong Products of Paths

open access: yesDiscussiones Mathematicae Graph Theory, 2019
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj   +1 more source

Foundational Machine‐Learning Interatomic Potential for Simulating Chemically Complex Ni‐Based Superalloys

open access: yesAdvanced Engineering Materials, EarlyView.
We apply a foundational machine‐learning interatomic potential based on the graph atomic cluster expansion (GRACE) to simulate the commercial Ni‐based single‐crystal superalloy CMSX‐4. Hybrid Monte‐Carlo/molecular dynamics sampling resolves short‐range order in the γ phase and L12 sublattice occupancies in the γ’ phase and connects them to stacking ...
Aditya Vishwakarma   +4 more
wiley   +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

AlgoDeGrafos: An Application to Assist in Course Lectures on Graph Theory

open access: yesCLEI Electronic Journal, 2009
This paper describes an application of the object-oriented paradigm to the construction of AlgoDeGrafos, a graph-theoretical system enabling the use of graph algorithms.
Denis S. Silveira   +2 more
doaj   +1 more source

Structure‐Guided Dynamical Mechanics in Bioinspired Double Twisted Laminated Thin Films

open access: yesAdvanced Functional Materials, EarlyView.
This work explores a dynamic mechanistic study of crack propagation and puncture testing via real‐time monitoring of crack initiation, propagation, and termination through nature‐inspired single and double twisted architectures fabricated from cellulose nanocrystals.
Justin Brackenridge   +4 more
wiley   +1 more source

Oriented Incidence Colourings of Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher   +3 more
doaj   +1 more source

Programmable 2D Magnetic Clusterphenes With High Curie Temperature and Strong Magnetic Anisotropy via Cluster Assembly and Ligand Synergy

open access: yesAdvanced Functional Materials, EarlyView.
Programmable 2D magnetic clusterphenes are realized through a ligand‐mediated cluster‐assembly strategy. Direct linking of magnetic superatomic clusters enhances electron delocalization and symmetry breaking, enabling the concurrent strengthening of magnetic exchange interactions and spin–orbit coupling.
Junxiang Fu   +13 more
wiley   +1 more source

Increasing Inter‐Micellar Connectivity Toughens and Imparts Cooling‐Induced Shape Memory in Micellar Hydrogels

open access: yesAdvanced Functional Materials, EarlyView.
Oligomerizing Pluronic triblock copolymers provides a processing strategy for tuning the mechanical properties and stimuli‐responsive behaviors of micellar hydrogels. Varying oligomer fraction produces hydrogels spanning brittle to highly extensible responses; maintaining micellar architectures enables cooling‐induced reverse thermal shape memory and ...
Gourav Kumbhojkar   +8 more
wiley   +1 more source

Cycles in Oriented 3-Graphs

open access: yesDiscrete & Computational Geometry, 2015
An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum of some of the triples that gives weight zero to each 2-set. Our aim in this paper is to consider the following question: how large can the girth of an oriented 3-graph (on $n$
Imre Leader, Ta Sheng Tan
openaire   +3 more sources

Home - About - Disclaimer - Privacy