Linear Diophantine labeling of graphs is an extension of the prime labeling of graphs. In this manuscript, we introduce some necessary conditions for determining whether a given graph admits linear Diophantine labeling or not, and if yes, we will find such a linear Diophantine labeling. We also study specific families of graphs, including the Complete graphs $K_n$, Wheel graphs $W_n$ and $W_{n,n}$, Circulant graphs $C_n(j)$, Path graphs $P_n(j)$, Cartesian product graphs $C_3 \times C_m$, Normal Product graphs $P_{n}\circ P_{n} $, Corona graphs $G\odot H$, Double Fan graphs $g_n=P_n+\overline{K_2}$, Power graphs $P^2_n$ and $P^3_n$, to ascertain their Diophantine nature.
The authors would like to express their gratitude to the referees for their insightful comments and valuable suggestions, which have greatly improved this manuscript.
| Primary Language | English |
|---|---|
| Subjects | Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics) |
| Journal Section | Research Article |
| Authors | |
| Submission Date | September 11, 2024 |
| Acceptance Date | January 6, 2025 |
| Publication Date | November 3, 2025 |
| Published in Issue | Year 2025 Volume: 15 Issue: 11 |