Ara
Toplam kayıt 328, listelenen: 321-328
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 ...
Ramsey numbers for class of edgeless, complete and star graphs
(Işık University Press, 2019)
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size ...
Approximation by Stancu type Jakimovski-Leviatan-Păltănea operators
(Işık University Press, 2019)
The present article deals with the general family of summation-integral type operators. Here, we introduce the Stancu type generalization of the Jakimovski-LeviatanPăltănea operators and study Voronovskaja-type asymptotic ...
Numerical solution of an inverse problem for the Liouville Equation
(Işık University Press, 2019)
We consider an inverse problem for the Liouville Equation. We present the solvability conditions and obtain numerical solution of the problem based on the finite difference approximation.
Some inclusion relations between various subclasses of planar harmonic mappings involving confluent hypergeometric distribution series
(Işık University Press, 2019)
The purpose of the present paper is to establish connections between various subclasses of harmonic univalent functions by applying certain convolution operator involving Confluent Hypergeometric distribution series. To ...
Degree of approximation by product (Ṅ, pn, qn)(E, q) summability of fourier serıes of a signal belonging to Lip(α, r)-class
(Işık University Press, 2019)
Approximation of periodic functions by different linear summation methods have been studied by many researchers. Further, for sharpening the estimate of errors out of the approximations several product summability methods ...
On hubtic and restrained hubtic of a graph
(Işık University Press, 2019-05-07)
In this article, the hubtic number of the join and corona of two connected graphs is computed. The restrained hubtic number ξr(G) of a graph G is the maximum number such that we can partition V (G) into pairwise disjoint ...
Some bounds on the Seidel energy of graphs
(Işık University Press, 2019)
This paper includes new bounds concepting the Seidel incidence energy. In the sequel, improved bounds about the Seidel Laplacian energy concerned with the edges and the vertices are established.