Ara
Toplam kayıt 2444, listelenen: 2201-2210
Generalized q-difference equation for the generalized q-operator r?s(Dq) and its applications in q-integrals
(Işık University Press, 2024-04)
In 2014, Fang [12] discovered a general q-exponential operator identity by solving a q-difference equation. Fang [12] developed some generalizations of q-integrals using this q-difference equation. Reshem and Saad [20] ...
Algebraic sum and algebraic product of spherical neutrosophic sets
(Işık University Press, 2024-04)
The Spherical Neutrosophic Set is a generalization of Spherical Fuzzy Set. In this paper, we define Algebraic sum and Algebraic product of spherical neutrosophic sets (SNSs) and investigate their desirable properties. ...
Binary ?ech soft closure spaces
(Işık University Press, 2024-04)
In this paper the notion of binary ?ech soft closure space which is defined over two initial universe sets with fixed sets of parameters is introduced and studied. This space extends and generalizes ?ech soft closure space. ...
On kernel distribution function estimation near end points
(Işık University Press, 2024-04)
Under that so-called boundary problem on kernel cumulative distribution function estimation, the main objective of this paper is to introduce and investigate the properties of our new estimator in order to improve the ...
2-ODD labeling of graphs using some graph operations
(Işık University Press, 2024-04)
2-odd labeling assigns distinct integers to the nodes of a graph G(V, E) in such a manner, that the positive difference of adjacent nodes is either 2 or an odd integer, 2k ± 1, k ? N. So, G is a 2-odd graph if and only if ...
Geodetic parameters in tree derived architectures
(Işık University Press, 2024-04)
A geodetic cover of a graph G refers to a subset of vertices of G that covers all the vertices of G using the shortest paths between the vertices in the set and the cardinality of a minimum geodetic cover is the geodetic ...
On edge irregularity strength of ladder related graphs
(Işık University Press, 2024-04)
For a simple graph G, a vertex labeling ? : V (G) ? {1, 2, . . . , k} is called k-labeling. The weight of an edge xy in G, written w?(xy), is the sum of the labels of end vertices x and y, i.e., w?(xy) = ?(x) + ?(y). A ...
Performance analysis of load based M/M/3 transient queueing system with finite capacity
(Işık University Press, 2024-01)
This paper deals with the investigation of M/M/3 queueing model under the provision of service rates of jobs depend upon the load of the jobs arrived in the system. The customers (jobs) arrive in the system in Poisson ...
A stochastic maximum principle for general mean-field backward doubly stochastic control
(Işık University Press, 2024-01)
In this paper we study the optimal control problems of general MckeanVlasov for backward doubly stochastic differential equations (BDSDEs), in which the coefficients depend on the state of the solution process as well as ...
Novel concepts in vague incidence graphs with application
(Işık University Press, 2024-01)
Fuzzy graph (FG) models enjoy the ubiquity of being in natural and humanmade structures, namely dynamic process in physical, biological, and social systems. As a result of inconsistent and indeterminate information inherent ...