Results 1 to 10 of about 46 (42)
Hooked k-extended Skolem sequences [PDF]
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Václav Linek
exaly +4 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
exaly +3 more sources
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
exaly +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
Disjoint skolem-type sequences and applications [PDF]
, 2018 Let D = {i₁, i₂,..., in} be a set of n positive integers. A Skolem-type sequence of order n is a sequence of i such that every i ∈ D appears exactly twice in the sequence at position aᵢ and bᵢ, and |bᵢ - aᵢ| = i.
Alghamdi, Naeemah
core
Gracefully labelled trees from Skolem and related sequences [PDF]
, 2001 In this thesis we use Skolem sequences, hooked Skolem sequences, and periodic odd sequences to find graceful labellings of trees. -- Using a particular Skolem sequence of order n we will produce a graceful labelling of a certain tree on 2n vertices ...
Morgan, David
core
Mathematical and algorithmic methods for finding disjoint Rosa-type sequences [PDF]
, 2018 A Rosa sequence of order n is a sequence S = (s1; s2; ..., s2n+1) of 2n + 1 integers satisfying the conditions: (1) for every k ∈ {1; 2;...; n} there are exactly two elements sᵢ; sj ∈ S such that si = sj = k; (2) if sᵢ = sj = k; i < j, then j - i = k;
Alruhaymi, Fatimah
core
Some of the next articles are maybe not open access.
Extended near Skolem sequences Part II
Journal of Combinatorial Designs, 2021Nabil Shalaby, Václav Linek
exaly
Extended near Skolem sequences Part I
Journal of Combinatorial Designs, 2021Nabil Shalaby, Václav Linek
exaly
Extended near Skolem sequences, Part III
Journal of Combinatorial Designs, 2022Nabil Shalaby, Václav Linek
exaly