In this paper, we propose a new sweep coverage problem: The Minimum Capacitated Sweep Cover (MinCapSC) problem, the goal of which is to design routes for the minimum number of mobile sensors such t ...
Abstract In this study, novel Hyperbolic spinor sequences of Jacobsthal, Jacobsthal–Lucas and Jacobsthal polynomial, which have not been studied before, are defined by investigating the relationship ...
Have you ever wondered, how to compute outside a computer? The Handbook of Unconventional Computing (In 2 Volumes), edited by Professor Andrew Adamatzky, offers unconventional ways of thinking about ...
Distinct points create the distance and comparison, and also everyone in this world is trying to minimize distance in one’s sense. Therefore, the real-life problem may be converted mathematically i ...
2nd Edition by Roel Prins (ETH Zürich, Switzerland), Anjie Wang (Dalian University of Technology, China), Xiang Li (Tianjin University of Science and Technology, China) and Foteini Sapountzi ...
For a finite group G G, and a subset S S of G G such that 1G ∉ S 1 G ∉ S, let Γ = Cay(G,S) Γ = Cay (G, S) be a Cayley graph of G G relative to S S. An arc-transitive graph Γ Γ is said to be 1-regular ...
The Pharmacological Effects of Gastrodin and the Progress in the Treatment of Neurological Disorders
Department of Neurology, The Second Hospital of Hebei Medical University, Shijiazhuang, Hebei 050000, China Department of Oral Medicine, The Second Hospital of Hebei Medical University, Shijiazhuang, ...
Abstract Denote by τ k (n), ω (n) and μ 2 (n) the number of representations of n as a product of k natural numbers, the number of distinct prime factors of n and the characteristic function of the ...
Department of Civil Engineering, Xi’an Jiaotong-liverpool University, Suzhou 215123, P. R. China Department of Civil and Environmental Engineering, The University of Liverpool, Liverpool, L69 3GQ, ...
This paper analyses recent scientific output on resilience in the fields of management and business. Based on a bibliometric analysis of publications indexed in the Scopus database for the period 2014 ...
Department of Mathematical Sciences, Tezpur University, Napaam 784028, Sonitpur, Assam, India Department of Mathematics, Sibsagar University, Joysagar 785665 ...
For an integer k ≥ 2, a k-tree T is defined to be a tree T with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G. Since a spanning 2-tree is a Hamilt ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results