Hegde, S.M.Shetty, S.2026-02-052009Discrete Mathematics, 2009, 309, 21, pp. 6160-61680012365Xhttps://doi.org/10.1016/j.disc.2009.05.028https://idr.nitk.ac.in/handle/123456789/27572In 1990, Acharya and Hegde introduced the concept of strongly k-indexable graphs: A (p, q)-graph G = (V, E) is said to be stronglyk -indexable if its vertices can be assigned distinct numbers 0, 1, 2, ..., p - 1 so that the values of the edges, obtained as the sums of the numbers assigned to their end vertices form an arithmetic progression k, k + 1, k + 2, ..., k + (q - 1). When k = 1, a strongly k-indexable graph is simply called a strongly indexable graph. In this paper, we report some results on strongly k-indexable graphs and give an application of strongly k-indexable graphs to plane geometry, viz; construction of polygons of same internal angles and sides of distinct lengths. © 2009 Elsevier B.V. All rights reserved.Arithmetic progressionsGraph GInternal anglesPlane geometryStrongly k-indexable graphs/labelingsVertex dependent characteristicGraph theory