<?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 2016, Vol 6, No 2</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2398" rel="alternate"/>
<subtitle>JAEM 2016, Vol 6, No 2 koleksiyonunu içerir.</subtitle>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2398</id>
<updated>2026-04-07T10:42:20Z</updated>
<dc:date>2026-04-07T10:42:20Z</dc:date>
<entry>
<title>G-(F; ? )-contractions in partial rectangular metric spaces endowed wıth a graph and fixed point theorems</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2605" rel="alternate"/>
<author>
<name>Shukla, Satish</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2605</id>
<updated>2024-05-07T21:36:05Z</updated>
<published>2016-06-22T00:00:00Z</published>
<summary type="text">G-(F; ? )-contractions in partial rectangular metric spaces endowed wıth a graph and fixed point theorems
Shukla, Satish
In this paper, the notion of G-(F, ? )-contractions in the context of partial rectangular metric spaces endowed with a graph is introduced. Some fixed point theorems for G-(F, ? )-contractions are also proved. The results of this paper generalize, extend, and unify some known results. Some examples are provided to illustrate the results proved herein.
</summary>
<dc:date>2016-06-22T00:00:00Z</dc:date>
</entry>
<entry>
<title>About an algorithm of function approximation by the linear splines</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2604" rel="alternate"/>
<author>
<name>Bayraktar, Bahtiyar</name>
</author>
<author>
<name>Cherimovich, Kudaev Valery</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2604</id>
<updated>2024-05-07T21:36:05Z</updated>
<published>2016-05-05T00:00:00Z</published>
<summary type="text">About an algorithm of function approximation by the linear splines
Bayraktar, Bahtiyar; Cherimovich, Kudaev Valery
The actual application for the problem of best approximation of grid function by linear splines was formulated. A mathematical model and a method for its solution were developed. Complexity of the problem was that it was multi – extremal and could not be solved analytically. The method was developed in order to solve the problem of dynamic programming scheme, which was extended by us. Given the application of the method to the problem of flow control in the pressure-regulating systems, the pipeline network for transport of substances (pipelines of water, oil, gas, and etc.) that minimizes the amount of substance reservoirs and reduces the discharge of substance from the system. The method and the algorithm developed here may be used in computational mathematics, optimal control and regulation system, and regressive analysis.
</summary>
<dc:date>2016-05-05T00:00:00Z</dc:date>
</entry>
<entry>
<title>On certain topological indices of the derived graphs of subdivision graphs</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2603" rel="alternate"/>
<author>
<name>Hosamani, Sunilkumar M.</name>
</author>
<author>
<name>Lokesha, Veerebradiah</name>
</author>
<author>
<name>Cangül, İsmail Naci</name>
</author>
<author>
<name>Devendraiah, K. M.</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2603</id>
<updated>2024-05-07T21:36:05Z</updated>
<published>2016-03-11T00:00:00Z</published>
<summary type="text">On certain topological indices of the derived graphs of subdivision graphs
Hosamani, Sunilkumar M.; Lokesha, Veerebradiah; Cangül, İsmail Naci; Devendraiah, K. M.
The derived graph [G]† of a graph G is the graph having the same vertex set as G, with two vertices of [G]† being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. There are numerous applications of graph theory in the field of structural chemistry. In this paper, we compute generalized Randi´c, general Zagreb, general sum-connectivity, ABC, GA, ABC4, and GA5 indices of the derived graphs of subdivision graphs.
</summary>
<dc:date>2016-03-11T00:00:00Z</dc:date>
</entry>
<entry>
<title>Some results on the distance r-b-coloring in graphs</title>
<link href="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2602" rel="alternate"/>
<author>
<name>Jothilakshmi, G.</name>
</author>
<author>
<name>Pushpalatha, A. P.</name>
</author>
<author>
<name>Suganthi, S.</name>
</author>
<author>
<name>Swaminathan, V.</name>
</author>
<id>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2602</id>
<updated>2024-05-07T21:36:05Z</updated>
<published>2016-01-01T00:00:00Z</published>
<summary type="text">Some results on the distance r-b-coloring in graphs
Jothilakshmi, G.; Pushpalatha, A. P.; Suganthi, S.; Swaminathan, V.
Given a positive integer r, two vertices u, v ? V (G) are r- independent if d(u, v) &gt; r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper.
</summary>
<dc:date>2016-01-01T00:00:00Z</dc:date>
</entry>
</feed>
