The derivation of 5^th order diagonal implicit type Runge Kutta methods (DITRKM5) for solving 3^rd special order ordinary differential equations (ODEs) is introduced in the present study. The DITRKM5 techniques are the name of the approach. This approach has three equivalent non-zero diagonal elements. To investigate the current study, a variety of tests for five various initial value problems (IVPs) with different step sizes h were implemented. Then, a comparison was made with the methods indicated in the other literature of the implicit RK techniques. The numerical techniques are elucidated as the qualification regarding the efficiency and number of function evaluations compared with another literature of the implic

In this paper, an Anti-Disturbance Compensator is suggested for the stabilization of a 6-DoF quadrotor Unmanned Aerial vehicle (UAV) system, namely, the Improved Active Disturbance Rejection Control (IADRC). The proposed Control Scheme rejects the disturbances subjected to this system and eliminates the effect of the uncertainties that the quadrotor system exhibits. The complete nonlinear mathematical model of the 6-DoF quadrotor UAV system has been used to design the four ADRCs units for the attitude and altitude stabilization. Stability analysis has been demonstrated for the Linear Extended State Observer (LESO) of each IADRC unit and the overall closed-loop system using Hurwitz stability criterion. A minimization to a

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C