<?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 2026, Vol 16, No 4</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7228" rel="alternate"/>
<subtitle>JAEM 2026, Vol 16, No 4 koleksiyonunu içerir.</subtitle>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7228</id>
<updated>2026-04-07T12:26:42Z</updated>
<dc:date>2026-04-07T12:26:42Z</dc:date>
<entry>
<title>Improving reliability allocation for complex networks using the Sea Lion Algorithm with three cost functions</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7238" rel="alternate"/>
<author>
<name>Madlool, Ghazi Abdullah</name>
</author>
<author>
<name>Mohammed Abbas, Nada</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7238</id>
<updated>2026-04-06T12:07:16Z</updated>
<published>2026-04-01T00:00:00Z</published>
<summary type="text">Improving reliability allocation for complex networks using the Sea Lion Algorithm with three cost functions
Madlool, Ghazi Abdullah; Mohammed Abbas, Nada
This research addresses the issue of improving the reliability of complex networks under multiple cost constraints by employing the Sea Lion Optimization (SLO) algorithm. The problem is framed as a constrained optimization model that aims to maximize system reliability by allocating reliability levels to network elements, considering three main cost functions: The proposed methodology relies on an adaptive search mechanism that dynamically balances the exploration and exploitation phases, enhancing the algorithm’s ability to overcome local non-optimal solutions and improve convergence stability. Cost constraints are also incorporated into the update process to ensure that solutions remain within defined economic limits without negatively impacting system performance. The numerical results showed that the proposed model achieves improved overall reliability, along with a more homogeneous reliability distribution among network components, thus reducing critical vulnerabilities and increasing the efficiency of the system as a whole.
</summary>
<dc:date>2026-04-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On Symmetric Neighbors degree sum exponent matrix</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7237" rel="alternate"/>
<author>
<name>Nalwad, Pushpa</name>
</author>
<author>
<name>Swamy, Narayan</name>
</author>
<author>
<name>Biradar, Aditya</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7237</id>
<updated>2026-04-06T11:50:29Z</updated>
<published>2026-04-01T00:00:00Z</published>
<summary type="text">On Symmetric Neighbors degree sum exponent matrix
Nalwad, Pushpa; Swamy, Narayan; Biradar, Aditya
Recently, exponent matrices have emerged as a dynamic tool for studying networks by measuring node centrality. In this work, we define a Symmetric Neighbors degree sum exponent matrix SN E(G) of a graph G whose (i, j)th entry is δδji + δδij for i ̸= j, it is zero otherwise, where δi is the Neighbors degree sum of a vertex vi in G. Inspired by the applications of Neighbors degree sum in redefining various degree based topological indices, we introduce characteristic polynomial of SN E(G), termed as Symmetric Neighbors degree sum exponent polynomial and the sum of absolute value of eigenvalue of SN E(G) matrix is called as Symmetric Neighbors degree sum exponentenergy. In this paper, we obtain the Neighbors degree sum exponent polynomial and Neighbors degree sum exponent energy of some graphs.
</summary>
<dc:date>2026-04-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Eccentricity spectra of some graph operations in regular graphs</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7236" rel="alternate"/>
<author>
<name>S., Surya</name>
</author>
<author>
<name>Ramachandran, Pramada</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7236</id>
<updated>2026-04-06T11:29:24Z</updated>
<published>2026-04-01T00:00:00Z</published>
<summary type="text">Eccentricity spectra of some graph operations in regular graphs
S., Surya; Ramachandran, Pramada
The eccentricity matrix of a graph G is derived from its distance matrix by letting the ijᵗʰ entry be equal to the distance between two vertices i and j, if the distance is the minimum of their eccentricities and zero otherwise. The eigenvalues of the eccentricity matrix of G are called ε-eigenvalues. Its ε-spectrum is the set of εeigenvalues together with its multiplicity and ε-energy is the sum of the absolute values of the ε-eigenvalues. In this paper, we study the ε-spectra of certain operations on regular graphs. We also established some bounds on ε-energy of graphs and characterize the extreme graphs.
</summary>
<dc:date>2026-04-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Fixed point analysis in quasi-partial metric spaces using w−interpolative Hardy-Rogers type contractions</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7235" rel="alternate"/>
<author>
<name>Sarma, Mrinal</name>
</author>
<author>
<name>Mushtaq, Aadil</name>
</author>
<author>
<name>Mongia, Annjan</name>
</author>
<author>
<name>Mongia, Anupal</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7235</id>
<updated>2026-04-06T11:10:31Z</updated>
<published>2026-04-01T00:00:00Z</published>
<summary type="text">Fixed point analysis in quasi-partial metric spaces using w−interpolative Hardy-Rogers type contractions
Sarma, Mrinal; Mushtaq, Aadil; Mongia, Annjan; Mongia, Anupal
By using Interpolative Hardy-Rogers type contraction via w−admissibility approach in the framework of quasi-partial metric space, we introduce a new property that makes it convenient to investigate the existence and uniqueness of fixed point theorems.
</summary>
<dc:date>2026-04-01T00:00:00Z</dc:date>
</entry>
</feed>
