PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 10, 20260 citationsOpen Access

Vertex Antimagic Edge Slither Labeling of Grid Graphs

View Full Paper
RSR. SreenivasanSeva Mandir

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

The grids are one of the most intriguing concepts that have wider area of applications in the field of science and technology. They are easy to construct and comprehend. The grids play a very important role specially in the networks and circuits. In this paper, the admissibility of vertex antimagic edge slither labeling, a special case of antimagic labeling to the grid graph G(1, n) is proved.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

R. Sreenivasan (2026) studied this question.

synapsesocial.com/papers/69d896566c1944d70ce07bfehttps://doi.org/10.5281/zenodo.19468991
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Vertex Antimagic Edge Slither Labeling Of Multi Leaf Caterpillar Graphs2026
  2. 2Antimagic Labeling for Some Snake Graphs2024
  3. 3Antimagic Labeling of Graphs Using Prime Numbers2024
  4. 4Comparative Study of Antimagic Labeling Approaches in Wireless, Interconnection, and Smart Grid Networks2026
  5. 5Graceful Antimagic Path and Cycle Related Graphs2024