<?xml version="1.0" encoding="UTF-8"?><feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>JAEM 2019, Vol 9, No 4</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2408" rel="alternate"/>
<subtitle>JAEM 2019, Vol 9, No 4 koleksiyonunu içerir.</subtitle>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2408</id>
<updated>2026-04-14T21:23:08Z</updated>
<dc:date>2026-04-14T21:23:08Z</dc:date>
<entry>
<title>An approximate wave solution for perturbed KDV and dissipative NLS equations: weighted residual method</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6036" rel="alternate"/>
<author>
<name>Demiray, Hilmi</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6036</id>
<updated>2024-07-17T12:41:14Z</updated>
<published>2019-10-01T00:00:00Z</published>
<summary type="text">An approximate wave solution for perturbed KDV and dissipative NLS equations: weighted residual method
Demiray, Hilmi
In the present work, we modified the conventional "weighted residual method" to some nonlinear evolution equations and tried to obtain the approximate progressive wave solutions for these evolution equations. For the illustration of the method we studied the approximate progressive wave solutions for the perturbed KdV and the dissipative NLS equations. The results obtained here are in complete agreement with the solutions of inverse scattering method. The present solutions are even valid when the dissipative effects are considerably large. The results obtained are encouraging and the method can be used to study the cylindrical and spherical evolution equations.
</summary>
<dc:date>2019-10-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Some bounds on the Seidel energy of graphs</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2786" rel="alternate"/>
<author>
<name>Kaya Gök, Gülistan</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2786</id>
<updated>2024-05-08T19:37:20Z</updated>
<published>2019-01-01T00:00:00Z</published>
<summary type="text">Some bounds on the Seidel energy of graphs
Kaya Gök, Gülistan
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.
</summary>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Approximation by Stancu type Jakimovski-Leviatan-Păltănea operators</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2785" rel="alternate"/>
<author>
<name>Kumar, Alok</name>
</author>
<author>
<name>Rai, Vandana</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2785</id>
<updated>2024-05-08T19:37:20Z</updated>
<published>2019-01-01T00:00:00Z</published>
<summary type="text">Approximation by Stancu type Jakimovski-Leviatan-Păltănea operators
Kumar, Alok; Rai, Vandana
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 theorem, local approximation, weighted approximation, rate of convergence and pointwise estimates using the Lipschitz type maximal function. Also, we propose a king type modification of these operators to obtain better estimates.
</summary>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On hubtic and restrained hubtic of a graph</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2784" rel="alternate"/>
<author>
<name>Khalaf, Shadi Ibrahim</name>
</author>
<author>
<name>Mathad, Veena</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2784</id>
<updated>2024-05-08T19:37:20Z</updated>
<published>2019-05-07T00:00:00Z</published>
<summary type="text">On hubtic and restrained hubtic of a graph
Khalaf, Shadi Ibrahim; Mathad, Veena
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 restrained hub sets. We compute the restrained hubtic number of some standard graphs. Some bounds for ξr(G) are obtained.
</summary>
<dc:date>2019-05-07T00:00:00Z</dc:date>
</entry>
</feed>
