Sharif Digital Repository

Let G and H be two graphs. A proper vertex coloring of G is called a dynamic coloring, if for every vertex v with degree at least 2, the neighbors of v receive at least two different colors. The smallest integer k such that G has a dynamic coloring with k colors denoted by χ2(G). We denote the cartesian product of G and H by G□H. In this paper, we prove that if G and H are two graphs and δ(G) ≥ 2, then χ2(G□H) ≤ max(χ2(G),x(H)). We show that for every two natural numbers m and n, m,n ≥ 2, χ2(Pm□Pn) = 4. Also, among other results it is shown that if 3|mn, then χ2(C m□Cn) = 3 and otherwise χ2(C m□Cn) = 4  

The square of a graph G denoted by G2, is the graph with the same vertex set as G and edges linking pairs of vertices at distance at most 2 in G. The chromatic number of the square of the Cartesian product of two cycles was previously determined for some cases. In this paper, we determine the precise value of χ((Cm□Cn)2) for all the remaining cases. We show that for all ordered pairs (m,n) except for (7,11) we have χ(Cm□Cn)2)=γV((Cm□Cn)2)|α((Cm□Cn)2), where α(G) denotes the independent number of G. This settles a conjecture of Sopena and Wu (2010). We also show that the smallest integer k such that χ(Cm□Cn2)≤6 for every m,≥k is 10. This answers a question of Shao and Vesel (2013)  

A proper vertex coloring of a graph G is called a star coloring if every two color classes induce a forest whose each component is a star, which means there is no bicolored P4 in G. In this paper, we show that the Cartesian product of any two cycles, except C3C3 and C3C5, has a 5-star coloring. © 2022 World Scientific Publishing Company  

The modified eccentricity connectivity polynomial of a connected graph G is defined as Ξ(G; x)=Σ u∈V(G)d G(u)x ε′G (u), where ε′ G(u)=Σ v∈NG(u)εG(u)and d G(u) is the degree of u in G. In this paper modified eccentric connectivity polynomial is computed for several classes of composite graphs  

We consider the game of cops and robber played on the Cartesian product of two trees. Assuming the players play perfectly, it is shown that if there are two cops in the game, then the length of the game (known as the 2-capture time of the graph) is equal to half the diameter of the graph. In particular, the 2-capture time of the m×n grid is proved to be ⌊m+n2⌋-1  

A new counting polynomial, called Omega, was recently proposed by Diudea. It is defined on the ground of opposite edge strips "ops". The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. A third one, called Theta polynomial is also derived from ops. In this paper we compute Omega, Sadhana and Theta polynomials of the Cartesian product graphs  

This paper illustrates how a 3 degrees of freedom, Cartesian robot can be given the task of playing ping-pong against a human player. We present an algorithm based on particle swarm optimization for the robot to calculate when and how to hit an approaching ball. Simulation results are shown to depict the effectiveness of our approach. Although emphasis is placed on sending the ball to a desired point on the ping pong table, it is shown that our method may be adjusted to meet the requirements of a variety of ball hitting strategies  

The Cartesian and Composition products are two well known graph products, also applied to interconnection networks area. The Cartesian and Composition network products possess great characteristics of fault resilience according to their high connectivity. In this paper, we study the existence and construction of parallel routing paths in these two well-known product networks. To prove the existence of certain number of parallel paths in these product networks, we need to compute their connectivity. By assuming the availability of certain number of faulty nodes, we propose some new shortest-path parallel routing algorithms. These algorithms can be used both in faulty networks and to route... 

This paper presents a comprehensive performance model for fully adaptive routing in wormhole-switched Cartesian product networks. Besides the generality of the model which makes it suitable to be used for any product graph, experimental (simulation) results show that the proposed model exhibits high accuracy even in heavy traffic and saturation region, where other models have severe problems to predict the performance of the network. Most popular interconnection network can be defined as a Cartesian product of two or more networks including the mesh, hypercube, and torus networks. Torus and mesh networks are the most popular topologies used in recent supercomputing parallel machines. They... 

This paper presents a comprehensive performance model for fully adaptive routing in wormhole-switched Cartesian product networks. Besides the generality of the model which makes it suitable to be used for any product graph, experimental (simulation) results show that the proposed model exhibits high accuracy even in heavy traffic and saturation region, where other models have severe problems to predict the performance of the network. Most popular interconnection network can be defined as a Cartesian product of two or more networks including the mesh, hypercube, and torus networks. Torus and mesh networks are the most popular topologies used in recent supercomputing parallel machines. They... 

In this paper a novel non-rotating space tethered configuration is introduced which its relative positions controlled using electromagnetic forces. The attitude dynamics is controlled by three reaction wheels in the body axes. The nonlinear coupled orbital dynamics of a dumbbell tethered satellite formation flight are derived through a constrained Lagrangian approach. These equations are presented in the leader satellite orbital frame. The tether is assumed to be mass-less and straight, and the J2 perturbation is included to the analysis. The forces and the moments of the electromagnetic coils are modeled based on the far-filed model of the magnetic dipoles. A guidance scheme for generating... 

An efficient and easy to implement method to generate Cartesian grids is presented. The presented method generates various kinds of Cartesian grids such as uniform, octree and embedded boundary grids. It supports the variation of grid size along each spatial direction as well as anisotropic and non-graded refinements. The efficiency and ease of implementation are the main benefits of the presented method in contrast to the alternative methods. Regarding octree grid generation, applying a simple and efficient data compression method permits to store all grid levels without considerable memory overhead. The presented method generates octree grids up to a 13-level refinement (81923 grids on the... 

We present a feasible full step interior-point algorithm to solve the (Formula presented.) horizontal linear complementarity problem defined on a Cartesian product of symmetric cones, which is not based on a usual barrier function. The full steps are scaled utilizing the Nesterov-Todd (NT) scaling point. Our approach generates the search directions leading to the full-NT steps by algebraically transforming the centring equation of the system which defines the central trajectory using the induced barrier of a so-called positive-asymptotic kernel function. We establish the global convergence as well as a local quadratic rate of convergence of our proposed method. Finally, we demonstrate that... 

In this paper, a nonlinear model reference adaptive impedance controller is proposed and tested. The controller provides asymptotic tracking of a reference impedance model for the robot end-effector in Cartesian coordinates applicable to rehabilitation robotics or any other human-robot interactions such as haptic systems. The controller uses the parameters of a desired stable reference model which is the target impedance for the robots end-effector. It also considers uncertainties in the model parameters of the robot. The asymptotic tracking is proven using Lyapunov stability theorem. Moreover, the adaptation law is proposed in joint space for reducing the complexity of its calculations;... 

We present an infeasible interior-point predictor–corrector algorithm, based on a large neighborhood of the central path, for horizontal linear complementarity problem over the Cartesian product of symmetric cones. Throughout the paper, we assume that a certain property holds for the above-mentioned problem. This condition is equivalent to the property of sufficiency for the particular case of horizontal linear complementarity problem. The polynomial convergence is shown for the commutative class of search directions. We specialize our algorithm further by prescribing some scaling elements and also consider the case of feasible starting points. We believe this to be the first interior-point... 

We present an infeasible interior-point predictor–corrector algorithm, based on a large neighborhood of the central path, for horizontal linear complementarity problem over the Cartesian product of symmetric cones. Throughout the paper, we assume that a certain property holds for the above-mentioned problem. This condition is equivalent to the property of sufficiency for the particular case of horizontal linear complementarity problem. The polynomial convergence is shown for the commutative class of search directions. We specialize our algorithm further by prescribing some scaling elements and also consider the case of feasible starting points. We believe this to be the first interior-point... 

In this paper, we propose a solution to the problem of capturing an intruder in a product network. This solution is derived based on the assumption of existing algorithms for basic member graphs of a graph product. In this problem, a team of cleaner agents are responsible for capturing a hostile intruder in the network. While the agents can move in the network one hop at a time, the intruder is assumed to be arbitrarily fast in a way that it can traverse any number of nodes contiguously as far as no agents reside in those nodes. Here, we consider a version of the problem where each agent can replicate new agents. Thus, the algorithm starts with a single agent and new agents are created on... 

In this paper, a new nonlinear robust adaptive impedance controller is addressed for Unmanned Aerial Vehicles (UAVs) equipped with a robot manipulator that physically interacts with environment. A UAV equipped with a robot manipulator is a novel system that can perform different tasks instead of human being in dangerous and/or inaccessible environments. The objective of the proposed robust adaptive controller is control of the UAV and its robotic manipulators end-effector impedance in Cartesian space in order to have a stable physical interaction with environment. The proposed controller is robust against parametric uncertainties in the nonlinear dynamics model of the UAV and the robot...