Results 1 to 10 of about 1,635,411 (70)
The existence of near-Skolem and hooked near-Skolem sequences
Discrete Mathematics, 1994 The author has studied the near-Skolem and hooked near-Skolem sequences and it is proved that the arithmetic necessary conditions for the existence of near-Skolem and hooked near-Skolem sequences are also sufficient. These sequences are defined by the following: Let \(m\), \(n\) be integers, \(m\leq n\).
Nabil Shalaby
openaire +3 more sources
The intersection spectrum of hooked Skolem sequences and applications
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nabil Shalaby, Daniela Silvesan
openaire +5 more sources
Hooked k-extended Skolem sequences
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Václav Linek, Zhike Jiang
openaire +2 more sources
On the Beta-Number of Forests with Isomorphic Components
Discussiones Mathematicae Graph Theory, 2018 The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio +3 more
doaj +1 more source
Some of the next articles are maybe not open access.
Extended near Skolem sequences Part II
Journal of Combinatorial Designs, 2021Nabil Shalaby, Vaclav Linek
exaly
Extended near Skolem sequences Part I
Journal of Combinatorial Designs, 2021Nabil Shalaby, Vaclav Linek
exaly
Extended near Skolem sequences, Part III
Journal of Combinatorial Designs, 2022Nabil Shalaby, Vaclav Linek
exaly
The existence of disjoint (hooked) near-Rosa sequences and applications
Journal of Combinatorial Designs, 2020Nabil Shalaby
exaly