Temel Bilimler Bölümü Bölümü Koleksiyonu
Recent Submissions
-
A Distributed depth first Search based algorithm for edge connectivity estimation
(IEEE, 2020)The edge connectivity of a network is the minimum number of edges whose removal disconnect the network. The edge connectivity determines the minimum number of edge-disjoint paths between all nodes. Hence finding the edge ... -
Whale optimization and sine-cosine optimization algorithms with cellular topology for parameter identification of chaotic systems and Schottky barrier diode models
(Springer, 2021)This research study aims to enhance the optimization accuracy of the two recently emerged metaheuristics of whale and sine-cosine optimizers by means of the balanced improvements in intensification and diversification ... -
Solid phase epitaxial thickening of boron and phosphorus doped polycrystalline silicon thin films formed by aluminium induced crystallization technique on glass substrate
(Elsevier Science Sa, 2019)Aluminium induced crystallization (AIC) technique can be used to form the high-quality and large-grained polycrystalline silicon (poly-Si) thin films, which are with the thickness of similar to 200 nm and used as a seed ... -
Set-Menger and related properties
(Elsevier, 2020)In this work, we consider new types of covering properties called set-Menger, set-Rothberger, set-Hurewicz and set-Gerlits-Nagy. We investigate the relationships between set-Mengerness and some other Menger-type covering ... -
Variations of some star selection properties
(Amer Inst Physics, 2021)In this paper we introduce some new types of star covering properties which we call set (strongly) star Menger, set (strongly) star Rothberger, set (strongly) star Hurewicz properties. We consider also weaker versions of ... -
PCDTBT:PCBM tabanlı organik Schottky diyotlarının ve Heteroeklem güneş hücrelerinin optoelektronik karakterizasyonu
(2019)Bu çalışmada Gümüş/n-tipi Silisyum/poly[N-9?-heptadecanyl-2,7–carbazole–alt-5,5-(4?,7?-di–2–thienyl-2?,1?,3?-benzothiadiazole:[6,6]-phenyl-C61-butyric acid methyl ester/Altın (Ag/n-Si/PCDTBT:PC61BM/Au) organik metalpolimer ... -
Parallel identification of central nodes in wireless multi-hop networks
(IEEE, 2020)A wireless multi-hop network is a collection of nodes that communicate by message passing over multiple links. Sending a message to a remote node can consume some energy from all intermediary nodes. In a network, the nodes ... -
Binomial sum formulas from the exponential generating functions of (P, q)−fibonacci and (p, q)−lucas quaternions
(Palestine Polytechnic University, 2021)In this paper, we obtain some binomial sum formulas for (p, q)-Fibonacci and (p, q)-Lucas quaternions, by using the exponential generating functions. By this way we ex-amine formulas for Q2n+r, K2n+r, pnQn+r, pnKn+r, Qmn, ... -
Quaternions via generalized Fibonacci and Lucas number components
(Editura Acad Romane, 2019)In this paper, we derive some combinatorial properties of generalized Fibonacci quaternion Q(n) and generalized Lucas quaternion K-n, where the components of Q(n) and K-n are generalized Fibonacci number U-n and generalized ... -
On the Diophantine equation L-n - L-m=2 . 3(a)
(Springer, 2019)In this paper we find (n, m, a) solutions of the Diophantine equation L-n - L-m = 2 . 3(a), where L-n and L-m are Lucas numbers with a >= 0 and n > m >= 0. For proving our theorem, we use lower bounds for linear forms in ... -
On solutions of the diophantine equation F-n-F-m=3(a)
(Springer India, 2019)In this paper, we find non-negative (n, m, a) integer solutions of the diophantine equation F-n-F-m = 3(a) where F-n and F-m are Fibonacci numbers. For proving our theorem, we use lower bounds in linear forms. -
(p; q)-FIBONACCI AND (p; q)-LUCAS SUMS BY THEDERIVATIVES OF SOME POLYNOMIALS
(2019)The main purpose of this paper is to survey several sum formulae of (p; q)Fibonacci number Un and (p; q)Lucas number Vn by using the Örst and the second derivatives of the equations x n = x 2 p x + q 0 @ nX1 j=0 Uj x n1j ... -
Independent strong weak domination: A mathematical programming approach
(World Scientific Publ Co Pte Ltd, 2020)Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in V - S is adjacent to at least one vertex of S. The domination number is the minimum cardinality of a dominating set. Let ... -
A progressive search algorithm for the minimum hitting set problem
(2021)Given a finite universe and a collection of the subsets of the universe, the minimum hitting set of thecollection is the smallest subset of the universe that has non-empty intersection with each set in thecollection. Finding ... -
A localized distributed algorithm for vertex cover problem
(Elsevier B.V., 2022)Finding the minimum vertex cover of a given graph is a well-known NP-Hard problem that has many applications in various fields. In this paper, we propose a distributed localized algorithm for detecting vertex cover using ...