Results 1 to 10 of about 125 (45)
List-antimagic labeling of vertex-weighted graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Zhanar Berikkyzy +4 more
doaj +5 more sources
Caterpillars Have Antimagic Orientations [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +3 more sources
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture [PDF]
, 2017 International audienceThis paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent ...
Bensmail, Julien +2 more
core +5 more sources
Perfect (super) Edge-Magic Crowns [PDF]
, 2017 A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is called an edge-magic labelling of G
López Masip, Susana Clara +2 more
core +4 more sources
Langford sequences and a product of digraphs [PDF]
, 2015 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
New Results on Subtractive Magic Graphs [PDF]
, 2021 For any edge xy in a directed graph, the subtractive edge-weight is the sum of the label of xy and the label of y minus the label of x. Similarly, for any vertex z in a directed graph, the subtractive vertex-weight of z is the sum of the label of z and ...
Davis, Aaron +2 more
core +1 more source
Enumerating super edge-magic labelings for the union of non-isomorphic graphs [PDF]
, 2011 A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1 such that: (1) f(u)+f(uv)+f(v)=k for all uv∈E; and (2) f(V )={i}pi=1.
A. AHMAD +11 more
core +5 more sources
Rainbow eulerian multidigraphs and the product of cycles [PDF]
, 2016 An arc colored eulerian multidigraph with l colors is rainbow eulerian if there is an eulerian circuit in which a sequence of l colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno et al.
López Masip, Susana Clara +1 more
core +7 more sources
$H$-product and $H$-threshold graphs
, 2011 This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent the graph ...
Bang-Jensen +26 more
core +1 more source