Results 151 to 160 of about 973,826 (351)
Integral sum graphs Gn and G-r,n are perfect graphs
AKCE International Journal of Graphs and CombinatoricsA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if
Julia K. Abraham +4 more
doaj +1 more source
A Formal Definition of Perfect Bayesian Equilibrium for Extensive Games [PDF]
Often, perfect bayesian equilibrium is loosely defined by stating that players should be sequentially rational given some beliefs in which Bayes rule is applied “whenever possible”.
Miguel Melendez-Jimenez +1 more
core
Discrete Mathematics, 1995 Let \(G\) be a graph. A set \(X\) of vertices of \(G\) is said to be a dominating set of vertices of \(G\) if \(V(G)\) is contained in the closed neighbourhood of \(X\). The smallest cardinality of a dominating set of vertices in \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). Let \(X\) be a set of vertices of \(G\).
openaire +2 more sources
Automated Extraction of Multicomponent Alloy Data Using Large Language Models for Sustainable Design
Advanced Science, EarlyView.A large language model (LLM) based pipeline is developed to automatically extract a comprehensive and accurate multicomponent alloy database from literature corpus. The extracted dataset is integrated with sustainability indicators to identify potential alloys that outperform existing industrial benchmark materials in terms of both performance and ...
Aravindan Kamatchi Sundaram +4 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 Science, EarlyView.A new data‐efficient framework combining DFT calculations, a neural network model, and automated graph analysis of catalytic reaction networks is proposed and applied to CO2 hydrogenation on transition metal nanoparticles. The analysis shows how efficient C2 oxygenate production requires a balance between CHx formation, C–C coupling, protonation, and ...
Mikhail V. Polynski, Sergey M. Kozlov
wiley +1 more source
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation [PDF]
Anand Babu N B +3 more
openalex +1 more source
Physics‐Informed Neural Network‐Enabled Forward Prediction and Inverse Design of Ring Origami
Advanced Science, EarlyView.This work presents a KRT‐PINN framework that integrates Kirchhoff rod theory with physics‐informed neural networks for the forward prediction and inverse design of ring origami consisting of closed‐loop rods. The framework predicts stable states of segmented rings with prescribed natural‐curvature profiles and determines the natural‐curvature profiles ...
Luyuan Ning +3 more
wiley +1 more source
Perfect state transfer on mixed graphs: complete classes and transfer times [PDF]
Xingkun Song
openalex +1 more source
Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics
Advanced Science, EarlyView.Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Dongyu Bai +3 more
wiley +1 more source