Results 61 to 70 of about 59,909 (247)
Advanced Intelligent Discovery, EarlyView.This study introduces FIRE‐GNN, a force‐informed, relaxed equivariant graph neural network for predicting surface work functions and cleavage energies from slab structures. By incorporating surface‐normal symmetry breaking and machine learning interatomic potential‐derived force information, the approach achieves state‐of‐the‐art accuracy and enables ...
Circe Hsu +5 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.Phonons‐informed machine‐learning predictive models are propitious for reproducing thermal effects in computational materials science studies. Machine learning (ML) methods have become powerful tools for predicting material properties with near first‐principles accuracy and vastly reduced computational cost.
Pol Benítez +4 more
wiley +1 more source
Intuitionistic Fuzzy Graphs with Categorical Properties
Fuzzy Information and Engineering, 2015 The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou +3 more
doaj +1 more source
On eternal domination and Vizing-type inequalities
AKCE International Journal of Graphs and Combinatorics, 2020 We show sharp Vizing-type inequalities for eternal domination. Namely, we prove that for any graphs G and H, where is the eternal domination function, α is the independence number, and is the strong product of graphs.
Keith Driscoll +4 more
doaj +1 more source
Some Results on incidence coloring, star arboricity and domination number [PDF]
, 2012 Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number, were established. Consequently, we deduced an upper bound and a lower bound of the incidence chromatic number for all graphs.
Shiu, Wai Chee, Sun, Pak Kiu
core
, 2012 We define the Cartesian product, composition, union and join on interval-valued fuzzy graphs and investigate some of their properties. We also introduce the notion of interval-valued fuzzy complete graphs and present some properties of self complementary
Akram +27 more
core +1 more source
Hamiltonicity and pancyclicity of cartesian products of graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Čada, Roman, Flandrin, Evelyne, Li, Hao
openaire +2 more sources
When Biology Meets Medicine: A Perspective on Foundation Models
Advanced Intelligent Discovery, EarlyView.Artificial intelligence, and foundation models in particular, are transforming life sciences and medicine. This perspective reviews biological and medical foundation models across scales, highlighting key challenges in data availability, model evaluation, and architectural design.
Kunying Niu +3 more
wiley +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
On $H$-antimagicness of Cartesian product of graphs
TURKISH JOURNAL OF MATHEMATICS, 2018 Summary: A graph \(G=(V(G),E(G))\) admits an \(H\)-covering if every edge in \(E\) belongs to a subgraph of \(G\) isomorphic to \(H\). A graph \(G\) admitting an \(H\)-covering is called \((a,d)\)-\(H\)-antimagic if there is a bijection \(f:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic ...
Bača, Martin +3 more
openaire +2 more sources