A (p, q)-graph G = (V, E) is said to be (k, d)-arithmetic, where k and d are positive integers if its p vertices admits a labeling of distinct non-negative integers such that the values of the edges obtained as the sums of the labels of their end vertices form the set {k, k + d, k + 2d, ..., k + (q - 1)d}. In this paper we prove that for all odd n, the generalized web graph W (t, n) and some cycle related graphs are (k, d)-arithmetic. Also we prove that a class of trees called T<inf>p</inf>-trees and subdivision of T<inf>p</inf>-trees are (k + q - 1) (d, d)-arithmetic for all positive integers k and d.

Hegde, S.M.Shetty, S.2026-02-05On arithmeIndian Journal of Pure and Applied Mathematics, 2002, 33, 8, pp. 1275-1283195588https://idr.nitk.ac.in/handle/123456789/279962002Arithmetic GraphsArithmetic LabelingsTreesA (p, q)-graph G = (V, E) is said to be (k, d)-arithmetic, where k and d are positive integers if its p vertices admits a labeling of distinct non-negative integers such that the values of the edges obtained as the sums of the labels of their end vertices form the set {k, k + d, k + 2d, ..., k + (q - 1)d}. In this paper we prove that for all odd n, the generalized web graph W (t, n) and some cycle related graphs are (k, d)-arithmetic. Also we prove that a class of trees called T<inf>p</inf>-trees and subdivision of T<inf>p</inf>-trees are (k + q - 1) (d, d)-arithmetic for all positive integers k and d.