Weighted-1-antimagic graphs of prime power order

DOI10.1016/J.DISC.2011.09.019zbMath1244.05186OpenAlexW1992901349MaRDI QIDQ432719

Xuding Zhu, Tsai-Lien Wong, Po-Yi Huang

Publication date: 4 July 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.019

zbMATH Keywords

combinatorial nullstellensatzantimagic labelingvertex weighted graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Related Items (14)

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 ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Neighbor sum distinguishing index of planar graphs ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ 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 ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs

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
• Computing and Combinatorics

This page was built for publication: Weighted-1-antimagic graphs of prime power order