Results 21 to 30 of about 42,493 (274)
Independent resolving sets in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence
B. Suganya, S. Arumugam
doaj +1 more source
Lagrange Dual Method for Sparsity Constrained Optimization
IEEE Access, 2018 In this paper, we investigate the l0 quasi-norm constrained optimization problem in the Lagrange dual framework and show that the strong duality property holds.
Wenxing Zhu +3 more
doaj +1 more source
A hierarchy of maximal intersecting triple systems [PDF]
Opuscula Mathematica, 2017 We reach beyond the celebrated theorems of Erdȍs-Ko-Rado and Hilton-Milner, and a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems.
Joanna Polcyn, Andrzej Ruciński
doaj +1 more source
IEEE Access, 2020 To fully utilize the dynamic reconfigurability of digital microfluidic biochips, most of electrodes would be shared by different droplets. Thus, contaminations caused by liquid residues among droplets are inevitable which lead to lethal errors in ...
Zhipeng Huang +4 more
doaj +1 more source
Comptes Rendus. Mathématique, 2023 Our aim in this paper is to show that the modulus of smoothness and the $K$-functionals constructed from the Sobolev-type space corresponding to the Dunkl operator are equivalent on the interval $(-1,1)$.
Saadi, Faouaz, Daher, Radouan
doaj +1 more source
On Generalized Jacobsthal and Jacobsthal–Lucas Numbers
Annales Mathematicae Silesianae, 2022 Jacobsthal numbers and Jacobsthal–Lucas numbers are some of the most studied special integer sequences related to the Fibonacci numbers. In this study, we introduce one parameter generalizations of Jacobsthal numbers and Jacobsthal–Lucas numbers.
Bród Dorota, Michalski Adrian
doaj +1 more source
Bipartite Random Graphs and Cuckoo Hashing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise.
Reinhard Kutzelnigg
doaj +1 more source
, 2022 In this volume, the authors present a self-contained introduction to discrete mathematics – the science of finite and countably infinite structures. In addition to taking a theoretical approach, they also include many practical exercises. The text covers a broad range of topics such as propositional logic, set theory as well as detailed treatments of ...
Boschini, Cecilia +2 more
openaire +3 more sources
An Effective Corner Increment-Based Algorithm for the Two-Dimensional Strip Packing Problem
IEEE Access, 2018 The 2-D strip packing problem is an NP-hard combinatorial optimization problem. Given a strip with fixed width and infinite height, the aim of strip packing is to pack a set of rectangles with known widths and heights into the strip such that the used ...
Zhen Chen, Jianli Chen
doaj +1 more source