We study dynamic systems on time scales that are generalizations of classical differential or difference equations. In this paper, we present the asymptotic stability of linear fractional time-invariant systems with the ...

If an infectious disease is eradicated in an area, the travelling of infected people can cause a re-epidemic of the disease in such area. Travelling is one of the influential factors in the spread of an infectious diseases. ...

In recent investigations, the study of coincidence points and common fixed points is a new development in the domain of contractive type single valued theory. In this paper, we introduce the concepts of some new generalized ...

A graph with directed edges is referred to be directed graph. It is possible to study and resolve problems with social connections, shortest paths, electrical circuits, etc. using directed graphs. D. Molodtsov proposed ...

In this paper, we have established some fixed point results in dislocated metric space. These results are proved for different types of contraction conditions using linear and rational expression for single as well as for ...

Prime anti-magic labeling techniques play a vital role in various types of real-world applications in sensor networks, smart city management systems, security models, surveillance systems, and so on. A prime anti-magic ...

In this paper, the Schauder conjecture for set-valued mappings is studied by using suitable conditions. Also, an existence theorem for a solution of quasi-equilibrium problem in the setting of topological vector spaces is ...

Işık Üniversitesi'nin tanıtıldığı kısa tanıtım filmi videosuna erişimdir.

In the paper the discrete linear quadratic optimization problem, where, over a certain part of the time interval, some coordinates of the control actions are known constants. These equalities in the form of a penalty ...

In this paper, we prove Wt □ G and Wt ⊠ G are not distance magic if graph G contains two vertices with the same neighborhood. And we also prove Wt × C4 (t ≥ 5), W3□Pn and W4 × Pn (n ≥ 3) are not distance magic graphs.