Ara
Toplam kayıt 24, listelenen: 11-20
An algorithmic approach to equitable edge chromatic number of graphs
(Işık University Press, 2019)
The equitable edge chromatic number is the minimum number of colors required to color the edges of graph G, for which G has a proper edge coloring and if the number of edges in any two color classes differ by at most one. ...
A new factor theorem on absolute matrix summability methods
(Işık University Press, 2019)
The aim of this paper is to obtain a new theorem dealing with absolute matrix summability factors.
Extended B-spline collocation method for KDV-Burgers equation
(Işık University Press, 2019)
The extended form of the classical polynomial cubic B-spline function is used to set up a collocation method for some initial boundary value problems derived for the Korteweg-de Vries-Burgers equation. Having nonexistence ...
A dynamical analysis of the virus replication epidemic model
(Işık University Press, 2019)
In this article, the stability and the computational algebraic properties of a virus replication epidemic model is investigated. The model is represented by a three dimensional dynamical system with six parameters. The ...
On a Robin problem ın Orlicz-Sobolev spaces
(Işık University Press, 2019)
In the present paper, we deal with the existence of solutions to a class of an elliptic equation with Robin boundary condition. The problem is settled in OrliczSobolev spaces and the main tool used is Ekeland’s variational ...
Decoding of orbit codes
(Işık University Press, 2019)
Subspace codes have an important role to correct errors and erasures for random network coding. Orbit codes are a family of constant dimension subspace codes and they are interesting for their error correction. In this ...
Mutant fuzzy sets
(Işık University Press, 2019)
In this paper, the notion of mutant fuzzy sets that by adhering to the classical sense in any semigroups has been introduced and its some of structural properties have been studied. In addition to this, the concept of ...
Chromatic weak domatic partition in graphs
(Işık University Press, 2019)
In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum ...
A digital scrambling method based on balancing numbers
(Işık University Press, 2019)
In this article, a new approach to the study of image scrambling based on balancing numbers, balancing transformation is presented. The properties of the proposed transformation and its periodicity are studied in details. ...
Divisor cordial labeling in the context of join and barycentric subdivision
(Işık University Press, 2019)
A divisor cordial labeling of a graph G with vertex set V (G) is a bijection f from V (G) to {1,2,...,|V(G)|} such that an edge e = uv is assigned the label 1 if f(u)|f(v) or f(v)|f(u) and the label 0 otherwise, then |e f ...