Results 81 to 90 of about 3,577 (286)
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
Weighted Szeged indices of some graph operations [PDF]
In this paper, the weighted Szeged indices of Cartesian product and Corona product of twoconnected graphs are obtained. Using the results obtained here, the weighted Szeged indices ofthe hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus ...
Kannan Pattabiraman, P. Kandan
doaj
Interval-Valued Fuzzy Soft Graphs
In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
A Multiplicative Version of Forgotten Topological Index [PDF]
In this paper, we present upper bounds for the multiplicative forgotten topological index of several graph operations such as sum, Cartesian product, corona product, composition, strong product, disjunction and symmetric difference in terms of the F ...
Asghar Yousefi +3 more
doaj +1 more source
Zip product of graphs and crossing numbers
D. Bokal proved that the crossing number is additive for the zip product under the condition of having two coherent bundles in the zipped graphs. This property is very effective when dealing with the crossing numbers of (capped) Cartesian product of ...
Dong, F. M. +7 more
core +1 more source
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
Complexity of Products of Some Complete and Complete Bipartite Graphs
The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete ...
S. N. Daoud
doaj +1 more source
Strong perfectness of the generalized Cartesian product of graphs
In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect.
Szelecka, Alina +3 more
core +1 more source
Quadrotor unmanned aerial vehicle control is critical to maintain flight safety and efficiency, especially when facing external disturbances and model uncertainties. This article presents a robust reinforcement learning control scheme to deal with these challenges.
Yu Cai +3 more
wiley +1 more source
On the δ-chromatic numbers of the Cartesian products of graphs
In this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source

