Yayın tarihi için JAEM 2020, Vol 10, No 2 listeleme
Toplam kayıt 27, listelenen: 21-27
-
Fuzzy perfect equitable domination excellent trees
(Işık University Press, 2020)A set D of vertices of a fuzzy graph G is a Perfect Dominating set if every vertex not in D is adjacent to exactly one vertex in D. In this paper, we discuss the concept of equitable excellent fuzzy graph, fuzzy equitable ... -
On Hardy type inequalities via K-fractional integrals
(Işık University Press, 2020)In this study, we will give the k-fractional integral inequalities to take advantage of the some results of Hardy type inequalities and some special cases. -
Numerical range and sub-self-adjoint operators
(Işık University Press, 2020)In this paper, we show that the numerical range of a bounded linear operatör T on a complex Hilbert space is a line segment if and only if there are scalars ? and µ such that T ? = ?T + µI, and we determine the equation ... -
Periodic and semi-periodic eigenvalues of hill's equation with symmetric double well potential
(Işık University Press, 2020)In this paper, some estimates are derived explicitly for periodic and semiperiodic eigenvalues of Hill’ s equation with symmetric double well potentials. Also, lengths of the instability intervals are obtained and bounds ... -
On two identities for I-function
(Işık University Press, 2020)In this research note, two interesting identities involving I-function of one variable introduced by Rathie have been derived. These results enable us to split a particular I-function into the sum of four I-functions. A ... -
Neighbourhoods of a certain subclass of strongly starlike functions
(Işık University Press, 2020)In this paper we introduce and study a new subclass of strongly starlike functions of order ? defined by convolution structure. We investigate neighbourhoods and coefficient bounds of this class. -
Degree equivalence graph of a graph
(Işık University Press, 2020)Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex set S. Given a graph with vertex set V , we can define an equivalence relation on V using the concept of degree of a vertex ...