Results 1 to 10 of about 27 (21)
Hooked k-extended Skolem sequences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Václav Linek, Zhike Jiang
exaly +5 more sources
The existence of near-Skolem and hooked near-Skolem sequences
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
exaly +4 more sources
The intersection spectrum of hooked Skolem sequences and applications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nabil Shalaby, Daniela Silvesan
exaly +5 more sources
On the Beta-Number of Forests with Isomorphic Components
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
The spectrum of Skolem and hooked Skolem sequences with a prescribed number of pairs in common and applications [PDF]
Daniela Silvesan
openalex
Some of the next articles are maybe not open access.
Extended near Skolem sequences Part II
Journal of Combinatorial Designs, 2021Vaclav Linek, Nabil Shalaby
exaly
Extended near Skolem sequences Part I
Journal of Combinatorial Designs, 2021Vaclav Linek, Nabil Shalaby
exaly
Extended near Skolem sequences, Part III
Journal of Combinatorial Designs, 2022Vaclav Linek, Nabil Shalaby
exaly
Skolem and Rosa rectangles and related designs
Discrete Mathematics, 2014Vaclav Linek, Nabil Shalaby
exaly
A survey of Skolem-type sequences and Rosa’s use of them
Mathematica Slovaca, 2009Eric Mendelsohn
exaly

