List-antimagic labeling of vertex-weighted graphs
arXiv:1510.05070 · doi:10.46298/dmtcs.5631
Abstract
A graph is - if for any vertex weighting and any list assignment with there exists an edge labeling such that for all , labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this paper we prove that every graph on vertices having no or component is -weighted-list-antimagic. An oriented graph is - if there exists an injective edge labeling from into such that the sum of the labels on edges incident to and oriented toward a vertex minus the sum of the labels on edges incident to and oriented away from that vertex is distinct from the difference of sums at every other vertex. We prove that every graph on vertices with no component admits an orientation that is -oriented-antimagic.
arXiv comment10 pages, 1 figure
References in corpus (6)
- Laughlin's wave functions, Coulomb gases and expansions of the discriminant
- Dense graphs are antimagic
- Antimagic orientation of biregular bipartite graphs
- Antimagic orientations of even regular graphs
- Antimagic orientations of disconnected even regular graphs
- Antimagic orientations of graphs with given independence number