Browsing Jaem 2015, Vol 5, No 2 by Category "Makale  Uluslararası Hakemli Dergi  Başka Kurum Yazarı"
Now showing items 113 of 13

Computational complexity of domination integrity in graphs
(Işık University Press, 2015)In a graph G, those dominating sets S which give minimum value for S + m(G−S), where m(G−S) denotes the maximum order of a component of G−S, are called dominating integrity sets of G (briefly called DIsets of G). This ... 
A efficient computational method for solving stochastic itôvolterra integral equations
(Işık University Press, 2015)In this paper, a new stochastic operational matrix for the Legendre wavelets is presented and a general procedure for forming this matrix is given. A computational method based on this stochastic operational matrix is ... 
Extensions of Kannan's fixed point results
(Işık University Press, 2015)In this article, we essentially proved some fixed point results for contractive maps type in quasipseudometric spaces. The presented theorems are formulated in an asymmetric setting and therefore generalize some existing ... 
The generalized Hahn polynomials
(Işık University Press, 2015)In this paper, we represent the generalized Hahn polynomials ϕ(a)n (x, y) by the Cauchy operator for deriving its identities: generating function, Mehler’s formula, Rogers formula (with some of its applications), Rogerstype ... 
An intelligent decision support tool for early diagnosis of functional pituitary adenomas
(Işık University Press, 2015)In this work, a web based integrated Medical Decision Support System (MDSS) tool for mainly early diagnosis of functional pituitary adenomas (i.e., somatotrophinoma, corticotrophinoma and prolactinoma) is developed. In the ... 
Linear retrial inventory system with second optional service under mixed priority service
(Işık University Press, 2015)The present paper deals with a generalization of the homogeneous single server finite source retrial inventory system with two classes of customers  one with high priority customer and the other with low priority customer. ... 
Monomial geometric programming with fuzzy relation equation constraints regarding maxbounded difference composition operator
(Işık University Press, 2015)In this paper, an optimization model with an objective function as monomial subject to a system of the fuzzy relation equations with maxbounded difference (maxBD) composition operator is presented. We firstly determine ... 
New results on cyclic nonlinear contractions in partial metric spaces
(Işık University Press, 2015)In this paper we study the concept of nonlinear cyclic Kannan and Chatterjea contractions in partial metric spaces and we prove some new theorems on fixed point for these types of mappings extending some fixed point ... 
On the hadamard product of balancing matrix and balancing matrix
(Işık University Press, 2015)In this paper, the matrix QnB ◦ Q−nB which is the Hadamard product of both balancing QnB matrix and balancing Q−nB matrix is introduced. Some properties of the Hadamard product of these matrices are investigated. A different ... 
Quadratic spline solution of calculus of variation problems
(Işık University Press, 2015)In this paper, we developed numerical method of order O(h2) and based on quadratic polynomial spline function for the numerical solution of class of two point boundary value problems arising in Calculus of Variation. The ... 
Similar ruled surfaces with variable transformations in minkowski 3space E3 1
(Işık University Press, 2015)In this study, we consider the notion of similar ruled surface for timelike and spacelike ruled surfaces in Minkowski 3space E31. We obtain some properties of these special surfaces in E31 and show that developable ruled ... 
Some new classes of graceful diameter six trees
(Işık University Press, 2015)Here we denote a diameter six tree by (a0; a1, a2, . . . , am; b1, b2, . . . , bn; c1, c2, . . . , cr), where a0 is the center of the tree; ai, i = 1, 2, . . . , m, bj , j = 1, 2, . . . , n, and ck, k = 1, 2, . . . , r are ... 
Trivially extendable graphs
(Işık University Press, 20150324)Let G be a simple graph. Let k be a positive integer. G is said to be kextendable if every independent set of cardinality k is contained in a maximum independent set of G. G is said to be trivially extendable if G is not ...