More on Classes of Strongly Indexable Graphs.

Given any positive integer k, a (p, q)-graph G = (V, E) is strongly k-indexable if there exists a bijection f : V → {0,1,2, …, p - 1} such that f +(E(G)) = {k, k + 1, k + 2, …, k + q - 1, } where f+(uv) = f (u)+ f (v) for any edge uv ϵ E; in particular, G is said to be strongly indexable when k = 1. For any strongly k-indexable (p, q)-graph G, q ≤ 2p - 3 and if, in particular, q = 2p - 3 then G is called a maximal strongly indexable graph. In this paper, our main focus is to construct more classes of k-strongly indexable graphs. [ABSTRACT FROM AUTHOR]