Results 11 to 20 of about 112 (75)
Skolem Number of Cycles and Grid Graphs [PDF]
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are that distance apart. This concept has naturally been generalized to labellings of other graphs, but always using at most two of any integer label.
Asplund, John, Carrigan, Braxton
core +2 more sources
Langford sequences and a product of digraphs [PDF]
Skolem and Langford sequences and their many generalizations have applications in numerous areas. The $\otimes_h$-product is a generalization of the direct product of digraphs. In this paper we use the $\otimes_h$-product and super edge-magic digraphs to
López, Susana-Clara +1 more
core +4 more sources
Block-avoiding point sequencings [PDF]
Let $n$ and $\ell$ be positive integers. Recent papers by Kreher, Stinson and Veitch have explored variants of the problem of ordering the points in a triple system (such as a Steiner triple system, directed triple system or Mendelsohn triple system) on $
Blackburn, Simon, Etzion, Tuvi
core +3 more sources
A generalization of the problem of Mariusz Meszka [PDF]
Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L.
Anita Pasotti, Antonio Pellegrini, Marco
core +1 more source
Skolem-type difference sets for cycle systems [PDF]
Cyclic m-cycle systems of order v are constructed for all m greater than or equal to 3, and all v = 1(mod 2m). This result has been settled previously by several authors.
Bryant, D., Gavlas, H., Ling, A. C. H.
core +1 more source
Difference families in Z_2d+1 x Z_2d+1 and infinite translation designs in Z x Z [PDF]
Si determinano famiglie infinite di differenze formate da 3-insiemi, estendendo alla dimensione 2 un noto risultato per la dimensione 1, inerente a famiglie di differenze triangolari.
VIETRI, Andrea
core +1 more source
Distance labelings: a generalization of Langford sequences [PDF]
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a path of order 2m in which each label from d up to d + m − 1 appears twice and in which the vertices that have been labeled with k are at distance k.
López Masip, Susana-Clara +1 more
core +4 more sources
Graceful labellings of new families of windmill and snake graphs [PDF]
A function ƒ is a graceful labelling of a graph G = (V,E) with m edges if ƒ is an injection ƒ : V (G) → {0, 1, 2, . . . ,m} such that each edge uv ∈ E is assigned the label |ƒ(u) − ƒ(v)| ∈ {1, 2, . . . ,m}, and no two edge labels are the same.
Alkasasbeh, Ahmad
core
Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of type $m^{\ell}
Merola, Francesca, Traetta, Tommaso
core +1 more source
This graphical abstract illustrates seven strategic pillars to advance a low‐carbon economy in ASEAN: Carbon Pricing & CBAM, Renewable Energy Auctions, Sustainable Finance Mobilization, Regional Carbon Trading Systems, Green Finance Standards, Private Sector Participation, and Digital‐Driven Monitoring & Trading. These elements aim to unlock investment,
Ohn Zin Lin +4 more
wiley +1 more source

