Abstract
Let be an graph. is said to be strongly indexable if there exists a bijection , such that , where for any edge . G is said to be indexable if is injective on . In this paper we construct classes of indexable graphs, and we give an upper bound for the number of edges of any graph on vertices to be indexable. Also, we determine all indexable graphs of order .
