<?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 2022, Vol 12, No 1</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3382" rel="alternate"/>
<subtitle>JAEM 2022, Vol 12, No 1 koleksiyonunu içerir</subtitle>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3382</id>
<updated>2026-04-09T02:45:44Z</updated>
<dc:date>2026-04-09T02:45:44Z</dc:date>
<entry>
<title>Y -cone metric spaces and coupled common fixed point results with application to integral equation</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3417" rel="alternate"/>
<author>
<name>Sharma, Richa</name>
</author>
<author>
<name>Chouhan, Virendra Singh</name>
</author>
<author>
<name>Mishra, Sanjay</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3417</id>
<updated>2024-05-07T21:36:31Z</updated>
<published>2022-01-01T00:00:00Z</published>
<summary type="text">Y -cone metric spaces and coupled common fixed point results with application to integral equation
Sharma, Richa; Chouhan, Virendra Singh; Mishra, Sanjay
This paper acquaints with a concept of Y -cone metric space and to study some topological properties of Y -cone metric space. We prove the coupled common fixed point results for mixed weakly monotone map in ordered Y -cone metric spaces. We give an example, which constitutes the main theorem.
</summary>
<dc:date>2022-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Some inequalities for the graph energy of distance Laplacian matrix</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3416" rel="alternate"/>
<author>
<name>Kaya Gök, Gülistan</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3416</id>
<updated>2024-05-07T21:36:30Z</updated>
<published>2022-01-01T00:00:00Z</published>
<summary type="text">Some inequalities for the graph energy of distance Laplacian matrix
Kaya Gök, Gülistan
In this paper, the distance laplacian energy for distance matrix is examined. Some bounds for the laplacian eigenvalues of distance matrix are expanded including the distances, the vertices and the edges. Indeed, different inequalities for the distance laplacian energy are found out.
</summary>
<dc:date>2022-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Central derivation of some classes of Leibniz algebras</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3415" rel="alternate"/>
<author>
<name>Almutari, Hassan</name>
</author>
<author>
<name>Ahmad, Abd Ghafur</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3415</id>
<updated>2024-05-07T21:36:30Z</updated>
<published>2022-01-01T00:00:00Z</published>
<summary type="text">Central derivation of some classes of Leibniz algebras
Almutari, Hassan; Ahmad, Abd Ghafur
In this study, we deal with central derivation of finite low dimensional Leibniz algebras. We provide some properties of the central derivation algebras. Description of the central derivation algebras, with their dimensions, for complex Leibniz algebras of dimensions two, three and four are given and summarized in tabular form. The result is then used to determine which centroid is decomposable or indecomposable.
</summary>
<dc:date>2022-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>The bounds for the largest eigenvalues of Fibonacci-sum and Lucas-sum graphs</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3414" rel="alternate"/>
<author>
<name>Taşcı, Dursun</name>
</author>
<author>
<name>Özkan Kızılırmak, Gül</name>
</author>
<author>
<name>Büyükköse, Şerife</name>
</author>
<author>
<name>Sevgi, Emre</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3414</id>
<updated>2024-05-07T21:36:31Z</updated>
<published>2022-01-01T00:00:00Z</published>
<summary type="text">The bounds for the largest eigenvalues of Fibonacci-sum and Lucas-sum graphs
Taşcı, Dursun; Özkan Kızılırmak, Gül; Büyükköse, Şerife; Sevgi, Emre
In this paper, we first get the degree of each point in Lucas-sum graph based on Lucas numbers. After that, we obtain lower and upper bounds for the largest eigenvalues ? and µ of the adjacency matrices of Fibonacci-sum and Lucas-sum graphs, respectively.
</summary>
<dc:date>2022-01-01T00:00:00Z</dc:date>
</entry>
</feed>
