Antimagic labelling of vertex weighted graphs

DOI10.1002/jgt.20624zbMath1244.05192MaRDI QIDQ2897212

Tsai-Lien Wong, Xuding Zhu

Publication date: 10 July 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20624

zbMATH Keywords

combinatorial nullstellensatz; vertex weighted graph; antimagic labelling

Mathematics Subject Classification ID

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C22: Signed and weighted graphs

Related Items

List-antimagic labeling of vertex-weighted graphs, Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic, Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz, A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles, Weighted antimagic labeling: an algorithmic approach, On antimagic labeling of regular graphs with particular factors, Neighbor sum distinguishing index of planar graphs, Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz, Neighbor sum distinguishing total colorings of planar graphs, The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles, On the neighbor sum distinguishing total coloring of planar graphs, On edge-graceful labeling and deficiency for regular graphs, Neighbor sum distinguishing total coloring of sparse IC-planar graphs, Weighted antimagic labeling, Antimagic labelings of caterpillars, Shifted-antimagic labelings for graphs, Antimagic labeling of forests with sets of consecutive integers, Graphs admitting antimagic labeling for arbitrary sets of positive numbers, Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24, Neighbor sum distinguishing total colorings of triangle free planar graphs, Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz, Graphs admitting antimagic labeling for arbitrary sets of positive integers, Local antimagic labeling of graphs, Antimagic labeling for unions of graphs with many three-paths

Cites Work

• Unnamed Item
• On anti-magic labeling for graph products
• Lattice grids and prisms are antimagic
• On zero-sum partitions and anti-magic trees
• The number of edge 3-colorings of a planar cubic graph as a permanent
• An Application of the combinatorial Nullstellensatz to a graph labelling problem
• Dense graphs are antimagic
• Combinatorial Nullstellensatz
• Anti‐magic graphs via the Combinatorial NullStellenSatz