Results 71 to 80 of about 3,577 (286)
Fork-Decomposition of Cartesian Product of Graphs
, 2023 Let G = (V, E) be a graph. Fork is a tree obtained by subdividing any edge of a star of size three exactly once. In this paper, we investigate the necessary and sufficient condition for the fork-decomposition of Cartesian product of ...
Issacraj, Samuel, Joseph, J. Paulraj
core +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
Graph decompositions for cartesian products
Electronic Notes in Discrete Mathematics, 2005 Abstract In this paper we describe an algorithmic construction that, given a tree-decomposition of a graph G and a path-decomposition of a graph H , provides a tree-decomposition of the cartesian product of G and H . From the latter, we derive upper bounds on the treewidth and on the pathwidth of the cartesian product, expressed in terms of the
openaire +1 more source
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
Hamiltonicity of Cartesian products of graphs
Graphs and CombinatoricsAbstract A path factor in a graph G is a factor of G in which every component is a path on at least two vertices. Let $$T\Box P_n$$
Irena Hrastnik Ladinek +3 more
openaire +2 more sources
E-cordial Labeling for Cartesian Product of Some Graphs
, 2011 We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 andK1,n × P2 are E-cordial for n odd.
Vaidya, S. K., Vyas, N. B.
core +1 more source
Advanced Intelligent Discovery, EarlyView.We report a novel interpretation method for deep learning models based on feature extraction and clustering. Applying this method to an atomistic line graph neural network (ALIGNN) model trained on optical absorption spectra of 2,681 inorganic compounds obtained from first‐principles calculations, we successfully identify key factors underlying ...
Akira Takahashi +3 more
wiley +1 more source
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source