<?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 2025, Vol 15, No 6</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6882" rel="alternate"/>
<subtitle>JAEM 2025, Vol 15, No 6 koleksiyonunu içerir.</subtitle>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6882</id>
<updated>2026-04-14T21:33:29Z</updated>
<dc:date>2026-04-14T21:33:29Z</dc:date>
<entry>
<title>Harmonic Mean Cordial labeling in the scenario of duplicating graph elements</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6902" rel="alternate"/>
<author>
<name>Gandhi, Harsh</name>
</author>
<author>
<name>Parejiya, Jaydeep</name>
</author>
<author>
<name>Jariya, Mahesh M.</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6902</id>
<updated>2025-06-05T07:08:31Z</updated>
<published>2025-06-01T00:00:00Z</published>
<summary type="text">Harmonic Mean Cordial labeling in the scenario of duplicating graph elements
Gandhi, Harsh; Parejiya, Jaydeep; Jariya, Mahesh M.
All the graphs considered in this article are simple and undirected. Let G = (V (G), E(G)) be a simple undirected Graph. A function f : V (G) → {1, 2} is called Harmonic Mean Cordial if the induced function f*: E(G) → {1, 2} defined by f*(uv) = ⌊2f(u)f(v)/f(u)+f(v)⌋ satisfies the condition |vf (i) − vf (j)| ≤ 1 and |ef (i) − ef (j)| ≤ 1 for any i, j ∈ {1, 2}, where vf (x) and ef (x) denotes the number of vertices and number of edges with label x respectively. A Graph G is called Harmonic Mean Cordial graph if it admits Harmonic Mean Cordial labeling. In this article, we have discussed Harmonic Mean Cordial labeling In The Scenario of Duplicating Graph Elements.
</summary>
<dc:date>2025-06-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Characterization of Pythagorean fuzzy k-ideals in Γ-semirings</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6901" rel="alternate"/>
<author>
<name>Anitha, T.</name>
</author>
<author>
<name>Lavanya, Y.</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6901</id>
<updated>2025-06-05T06:52:04Z</updated>
<published>2025-06-01T00:00:00Z</published>
<summary type="text">Characterization of Pythagorean fuzzy k-ideals in Γ-semirings
Anitha, T.; Lavanya, Y.
In this paper, we introduce the algebraic structures of Pythagorean fuzzy set in Γ semirings. Moreover we characteristics some interesting properties, results.
</summary>
<dc:date>2025-06-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>The novel Bessel–Maitland function involving some characteristic properties and integral transforms</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6900" rel="alternate"/>
<author>
<name>Khan, Nabiullah</name>
</author>
<author>
<name>Sk, Rakibul</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6900</id>
<updated>2025-06-05T06:36:22Z</updated>
<published>2025-06-01T00:00:00Z</published>
<summary type="text">The novel Bessel–Maitland function involving some characteristic properties and integral transforms
Khan, Nabiullah; Sk, Rakibul
Inspired by certain recent generalizations of the Bessel-Maitland function in this paper, we introduce a new extension of the Bessel-Maitland function associated with the beta function. Some of its characteristic properties including integral representation, recurrence relation and differentiation formula are investigated. Furthermore, we evaluated some integral transforms such as the Mellin transform, K- transform, Euler transform, Laplace transform and Whittaker transform. In addition, we investigated Riemann-Liouville fractional integrals for this Bessel-Maitland function.
</summary>
<dc:date>2025-06-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Extracting triple connected certified domination number for the strong product of paths and cycles</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6899" rel="alternate"/>
<author>
<name>Mahadevan, G.</name>
</author>
<author>
<name>Selvam, Kaviya</name>
</author>
<author>
<name>Sivagnanam, C.</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6899</id>
<updated>2025-06-05T06:19:28Z</updated>
<published>2025-06-01T00:00:00Z</published>
<summary type="text">Extracting triple connected certified domination number for the strong product of paths and cycles
Mahadevan, G.; Selvam, Kaviya; Sivagnanam, C.
A dominating set S of a graph G is said to be a triple connected certified dominating set (TCCD - set) if for every vertex v ∈ S, | N(v) ∩ (V − S) | ≠ 1 and ⟨S⟩ is triple connected. The minimum cardinality of a TCCD - set is called the triple connected certified domination number (TCCD - number) and is denoted by γT CC (G). The novelty of triple connected certified domination number is which the certified domination holds the triple connected in induced S. The upper bound and loweer bound of γT CC for the given graphs is found and then proved that the upper bound and lower bound of γT CC were equal. This article investigates the TCCD number for the strong product of paths and cycles.
</summary>
<dc:date>2025-06-01T00:00:00Z</dc:date>
</entry>
</feed>
