Results 71 to 80 of about 59,909 (247)
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
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
Advanced Intelligent Systems, Volume 7, Issue 3, March 2025.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
Weighted Szeged indices of some graph operations [PDF]
Transactions on Combinatorics, 2016 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
Topological Algebra and its Applications, 2017 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]
Mathematics Interdisciplinary Research, 2019 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
Distinguishing Number for some Circulant Graphs [PDF]
, 2014 Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs
Gravier, Sylvain +2 more
core
BMPCQA: Bioinspired Metaverse Point Cloud Quality Assessment Based on Large Multimodal Models
Advanced Intelligent Systems, EarlyView.This study presents a bioinspired metaverse point cloud quality assessment metric, which simulates the human visual evaluation process to perform the point cloud quality assessment task. It first extracts rendering projection video features, normal image features, and point cloud patch features, which are then fed into a large multimodal model to ...
Huiyu Duan +7 more
wiley +1 more source
Complexity of Products of Some Complete and Complete Bipartite Graphs
Journal of Applied Mathematics, 2013 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
Treewidth of Cartesian Products of Highly Connected Graphs [PDF]
Journal of Graph Theory, 2012 AbstractThe following theorem is proved: for all k‐connected graphs G and H each with at least n vertices, the treewidth of the cartesian product of G and H is at least . For , this lower bound is asymptotically tight for particular graphs G and H. This theorem generalizes a well‐known result about the treewidth of planar grid graphs.
openaire +3 more sources