Add to ORKGPseudo-Skolem sequences, which are similar to Skolem-type sequences in their structure and applications, are introduced. Constructions of such sequences, either directly or via the use of known Skolem-type sequences, are presented. The applicability of these sequences to Skolem labelled graphs, in particular classes of rail-siding graphs and caterpillars, are also discussed
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
AbstractThe purpose of this note is to give upper bounds (assuming P different from NP) on how far t...
Skolem mean labeling of the four star G = K K K K ∪ ∪ ∪ 1 1, ,η η 1,τ 1,τ 1 2 1 2 where 2 η η 1 and...
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are th...
We highlight some connections between graph labelling, combinatorial design theory and information t...
AbstractThe purpose of the paper is to study relations between graceful numbering of certain 2-regul...
AbstractA Skolem labelled graph is a triple (G, L, d), where G = (V, E) is a graph and L:V → d, d + ...
Skolem sequences and Skolem labelled graphs have been described and examined for several decades. Th...
For each n ≥ 1and1≤j ≤ n we show the existence of an extended Skolem sequence of order n starting wi...
AbstractA Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem grace...
AbstractA Skolem sequence is a sequence a1,a2,…,a2n (where ai∈A={1,…,n}), each ai occurs exactly twi...
Assume that we have m identical graphs where the graphs consists of paths with k vertices where k is...
AbstractA new relation between extended Skolem sequences (i.e., Skolem sequences with one zero eleme...
AbstractA Skolem sequence is a sequence s1,s2,…,s2n (where si∈A={1,…,n}), each si occurs exactly twi...
In this thesis we use Skolem sequences, hooked Skolem sequences, and periodic odd sequences to find ...
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
AbstractThe purpose of this note is to give upper bounds (assuming P different from NP) on how far t...
Skolem mean labeling of the four star G = K K K K ∪ ∪ ∪ 1 1, ,η η 1,τ 1,τ 1 2 1 2 where 2 η η 1 and...
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are th...
We highlight some connections between graph labelling, combinatorial design theory and information t...
AbstractThe purpose of the paper is to study relations between graceful numbering of certain 2-regul...
AbstractA Skolem labelled graph is a triple (G, L, d), where G = (V, E) is a graph and L:V → d, d + ...
Skolem sequences and Skolem labelled graphs have been described and examined for several decades. Th...
For each n ≥ 1and1≤j ≤ n we show the existence of an extended Skolem sequence of order n starting wi...
AbstractA Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem grace...
AbstractA Skolem sequence is a sequence a1,a2,…,a2n (where ai∈A={1,…,n}), each ai occurs exactly twi...
Assume that we have m identical graphs where the graphs consists of paths with k vertices where k is...
AbstractA new relation between extended Skolem sequences (i.e., Skolem sequences with one zero eleme...
AbstractA Skolem sequence is a sequence s1,s2,…,s2n (where si∈A={1,…,n}), each si occurs exactly twi...
In this thesis we use Skolem sequences, hooked Skolem sequences, and periodic odd sequences to find ...
A graph G (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it i...
AbstractThe purpose of this note is to give upper bounds (assuming P different from NP) on how far t...
Skolem mean labeling of the four star G = K K K K ∪ ∪ ∪ 1 1, ,η η 1,τ 1,τ 1 2 1 2 where 2 η η 1 and...