Results 91 to 100 of about 3,558 (256)
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
Vertex and edge PI indices of Cartesian product graphs [PDF]
, 2007 The Padmakar–Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v. In this paper, the notion of vertex PI index of a graph is introduced.
M.H. Khalifeh +5 more
core +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
Uniform emulations of Cartesian-product and Cayley graphs [PDF]
, 2002 In this paper, we consider graphs modeling interconnection networks of parallel systems and we deal with network simulations. More specifically, we focus on simulations involving Cartesian-product graphs and some subclasses of Cayley graphs.We study ...
Barth, D. +5 more
core +1 more source
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
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
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
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
Asia-Pacific Journal of Chemical Engineering, EarlyView.ABSTRACT Efficient thermal management in advanced industrial systems requires improved heat transfer performance, particularly under non‐Newtonian fluid behavior and complex surface geometries. This study investigates the two‐dimensional flow and heat transfer characteristics of ternary hybrid nanofluids over both stationary and moving wedge surfaces ...
A. O. Akindele +4 more
wiley +1 more source
On the δ-chromatic numbers of the Cartesian products of graphs
Open MathematicsIn 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