Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7148
Browse
3 results
Search Results
Article On the Construction of Xor-Magic Graphs(Elsevier, 2026) Batal, AhmetA simple connected graph of order 2nis defined as a xor-magic graph of power n if its vertices can be labeled with vectors from Fn2 in a one-to-one manner such that the sum of labels in each closed neighborhood set of vertices equals zero. In this paper, we introduce a method called the self-switching operation, which, when properly applied to an odd xor-magic graph of power n, generates a xor-magic graph of power n + 1. We demonstrate the existence of a proper self-switching operation for any given odd xor-magic graph and provide a characterization of the cut space of a connected graph in the process. We also observe that the Dyck graph can be obtained from the complete graph of order 4 by applying three successive self-switching operations. Additionally, we investigate various graph products, including Cartesian, tensor, strong, lexicographical, and modular products. We observe that these products allow us to generate xor-magic graphs by selecting appropriate factor graphs. Notably, we discover that a modular product of graphs is always a xor-magic graph when the orders of its factors are powers of 2 (except for 2 itself). In the process, we realize that the Clebsch graph is the modular product of the cycle graph and the empty graph, each of order 4. By combining the self-switching operation with the modular product, we establish the existence of k-regular xor-magic graphs of power n for all n >= 2 and for all k is an element of {3, 5, 7, ... , 2n-5}boolean OR{2n-1}. We also prove that there is no (2n-3)-regular xor-magic graph of power n. Lastly, we introduce two more methods to produce xor-magic graphs. One method utilizes Cayley graphs and the other utilizes linear algebra. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.Article Citation - WoS: 1Citation - Scopus: 1Irreducibility and Primality in Differentiability Classes(Michigan State University Press, 2023) Batal, Ahmet; Eyidoğan, S.; Göral, HaydarIn this note, we give criteria for the irreducibility of functions in Cm [0, 1], where m ∈ {1, 2, 3, ...} ∪ {∞} ∪ {ω}. We also discuss irreducibility in multivariable differentiability classes. Moreover, we characterize irreducible functions and maximal ideals in C∞ [0, 1]. In fact, irreducible and prime smooth functions are the same, and every maximal ideal of C∞ [0, 1] is principal. © 2023 Michigan State University Press. All rights reserved.Article Citation - WoS: 7Citation - Scopus: 7Output Feedback Stabilization of the Linearized Korteweg-De Vries Equation With Right Endpoint Controllers(Elsevier Ltd., 2019) Batal, Ahmet; Özsarı, TürkerIn this paper, we prove the output feedback stabilization for the linearized Korteweg-de Vries (KdV) equation posed on a finite domain in the case the full state of the system cannot be measured. We assume that there is a sensor at the left end point of the domain capable of measuring the first and second order boundary traces of the solution. This allows us to design a suitable observer system whose states can be used for constructing boundary feedbacks acting at the right endpoint so that both the observer and the original plant become exponentially stable. Stabilization of the original system is proved in the L-2-sense, while the convergence of the observer system to the original plant is also proved in higher order Sobolev norms. The standard backstepping approach used to construct a left endpoint controller fails and presents mathematical challenges when building right endpoint controllers due to the overdetermined nature of the related kernel models. In order to deal with this difficulty we use the method of Ozsan and Batal, (2019) which is based on using modified target systems involving extra trace terms. In addition, we show that the number of controllers and boundary measurements can be reduced to one, with the cost of a slightly lower exponential rate of decay. We provide numerical simulations illustrating the efficacy of our controllers. (C) 2019 Elsevier Ltd. All rights reserved.