Realization of digraphs in Abelian groups and its consequences
Copyright policy )Realization of digraphs in Abelian groups and its consequences
AbstractLet be a directed graph of order with no component of order less than 3, and let be a finite Abelian group such that or if is large enough with respect to an arbitrarily fixed then . We show that there exists an injective mapping from to the group such that for every connected component of , where 0 is the identity element of . Moreover we show some applications of this result to group distance magic labelings.
Graph labelling (graceful graphs, bandwidth, etc.), distance magic graph, zero-sum partition, FOS: Mathematics, Directed graphs (digraphs), tournaments, graph labeling, Mathematics - Combinatorics, Combinatorics (math.CO), group irregular labeling, Graphs and abstract algebra (groups, rings, fields, etc.)
Graph labelling (graceful graphs, bandwidth, etc.), distance magic graph, zero-sum partition, FOS: Mathematics, Directed graphs (digraphs), tournaments, graph labeling, Mathematics - Combinatorics, Combinatorics (math.CO), group irregular labeling, Graphs and abstract algebra (groups, rings, fields, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!