Results 81 to 90 of about 3,558 (256)
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
Cartesian Products of Graphs and Metric Spaces
European Journal of Combinatorics, 2000 The authors give a short proof of the known fact that decomposition of a connected graph into a cartesian product of indecomposable factors is unique up to isomorphism. They then present a generalization of the results which shows uniqueness of decomposition for a wide class of product operations on general finite metric spaces.
Sergey V. Avgustinovich +1 more
openaire +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
Total $k$-domination in Cartesian product of complete graphs [PDF]
, 2022 Let $G=(V,E)$ be a finite undirected graph. A set $S$ of vertices in $V$ is said to be total $k$-dominating if every vertex in $V$ is adjacent to at least $k$ vertices in $S$.
Wisby, Justin, Carballosa, Walter
core +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
Advanced Intelligent Discovery, EarlyView.AI‐BioMech is a deep learning framework that predicts the mechanical behavior of biological cellular materials directly from 2D images. By replacing traditional finite element analysis with semantic segmentation, it identifies stress and strain distributions with 99% accuracy, offering a high‐speed, scalable alternative for analyzing complex, aperiodic
Haleema Sadia +2 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
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
Advanced Intelligent Systems, Volume 7, Issue 3, March 2025.This article reviews the current state of bioinspired soft robotics. The article discusses soft actuators, soft sensors, materials selection, and control methods used in bioinspired soft robotics. It also highlights the challenges and future prospects of this field.
Abhirup Sarker +2 more
wiley +1 more source