JAEM 2019, Vol 9, No 2: Recent submissions
Now showing items 1-20 of 24
-
Zagreb indices and multiplicative Zagreb indices of double graphs of subdivision graphs
(Işık University Press, 2019)Let G be a simple graph. The subdivision graph and the double graph are the graphs obtained from a given graph G which have several properties related to the properties of G. In this paper, the first and second Zagreb and ... -
Boundedly solvability of first order delay differential operators with piecewise constant arguments
(Işık University Press, 2019)Using the methods of operator theory, we investigate all boundedly solvable extensions of a minimal operator generated by first order delay differential-operator expression with piecewise constant argument in the Hilbert ... -
Harmonious coloring of multicopy of complete graphs
(Işık University Press, 2019)In this paper, we find the harmonious chromatic number of multicopy of complete graphs Kn. We generalize the result ?H ((n + 2)Kn) > n + 1 2 ! given in [8] and also further improve the result to ?H((n + 2)Kn) ? n + 1 2 ! ... -
On a distribution of the process describing a service system with unreliable devices
(Işık University Press, 2019)In the paper, the distribution is found for the process {?t, ?t}, t ? 0, in the terms of Laplace transformation. The considered process describes the queuing system with nonhomogeneous Poisson stream of demands and n ... -
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. -
Measurement of planarity in product bipolar fuzzy graphs
(Işık University Press, 2019)Bipolar fuzzy set theory provides a basis for bipolar cognitive modeling and multiagent decision analysis, where in some situations, the product operator may be preferred to the min operator, from theoretical and experimental ... -
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. ... -
Vulnerability in networks
(Işık University Press, 2019)Recently defined exponential domination number is reported as a new measure to graph vulnerability. It is a methodology, emerged in graph theory, for vulnerability analysis of networks. Also, it gives more sensitive results ... -
Product of bipolar intuitionistic fuzzy graphs and their degree
(Işık University Press, 2019)In this paper, bipolar intuitionistic fuzzy graphs with four operations namely Cartesian product, composition, tensor product, normal product are defined. Also, the degrees of the vertices of the resultant graphs which are ... -
Intuitionistic fuzzy bi-implicator and properties of Lukasiewicz intuitionistic fuzzy bi-implicator
(Işık University Press, 2019)This paper presents axiomatic as well as constructive definitions of intuitionistic fuzzy bi-implicators based on intuitionistic fuzzy t-norms and their intuitionistic fuzzy residual implicators. The inter-relationship ... -
Trans-Sasakian manifolds satisfying certain conditions
(Işık University Press, 2019)The objective of the present paper is to study the properties of special weakly Ricci symmetric and generalized Ricci recurrent trans Sasakian manifolds. -
Tight just excellent graphs
(Işık University Press, 2019)A graph G is ?-excellent if for every vertex v, there exists a chromatic partition ? such that {v} ? ?.A graph G is just ?-excellent if every vertex appears as a singleton in exactly one ?-partition. In this paper, a special ... -
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. ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
Early detection of rogue waves using compressive sampling
(Işık University Press, 2019)We discuss the possible usage of the compressive sampling for the early detection of the rogue waves. One of the promising techniques for the early detection of the rogue waves is to measure the triangular Fourier spectra ... -
Exponential domination of tree related graphs
(Işık University Press, 2019)The well-known concept of domination in graphs is a good tool for analyzing situations that can be modeled by networks. Although a vertex in the graph can exert influence on, or dominate, all vertices in its immediate ...
