Vertex Antimagic Edge Slither Labeling of Grid Graphs

Key Points

• The study aims to prove the admissibility of vertex antimagic edge slither labeling for grid graph G(1, n).
• Constructed grid graph G(1, n)
• Applied vertex antimagic edge slither labeling techniques
• Conducted theoretical proof for admissibility
• Proved that vertex antimagic edge slither labeling can be applied to grid graphs
• Confirmed its relevance in the contexts of networks and circuits

Abstract