Results 61 to 70 of about 39,180 (264)
Advanced Engineering Materials, EarlyView.The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling +15 more
wiley +1 more source
Discrete Mathematics, 1978 AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number equals the number of (maximal) cliques. We characterize the trivially perfect graphs as a proper subclass of the triangulated graphs (thus disproving a claim of Buneman [3]), and we relate them to some well-known classes of perfect graphs.
openaire +2 more sources
Advanced 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
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
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Ural Mathematical Journal, 2020 Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced Functional Materials, EarlyView.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
Advanced 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
On the perfect graph conjecture
Discrete Mathematics, 1976 We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the graph is perfect. This generalizes a result of Gallai and Suranyi and also a result of Olaru and Sachs.
openaire +1 more source
A 3D Human Neuron‐on‐Chip Platform to Monitor Neuronal Injury Responses
Advanced Healthcare Materials, EarlyView.This study presents a novel 3D Neuron‐on‐Chip model that can maintain human PSC‐derived excitatory prefrontal cortex neurons in 3D hydrogels and can be used to monitor neuronal injury responses over time. Results show injury‐induced acute neuronal excitotoxicity, declining neuronal connectivity, and the activation of a neurodegenerative, SASP‐like ...
Ruiping Tang +16 more
wiley +1 more source
Perfect Roman and Perfect Italian Domination of Cartesian Product Graphs
Scientific Journal of King Faisal University: Basic and Applied SciencesFor a graph G=(V,E), a function f:V→{0,1,2} is a perfect Roman dominating function (PRDF) on G if every v∈V with f(v)=0 is adjacent to exactly one vertex u with f(u)=2. The sum ∑_(v∈V)^▒f (v) is the weight w(f) of f.
Ahlam Almulhim
doaj +1 more source