id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-577	Augustine, Germina Kizhekekunnel	More on Classes of Strongly Indexable Graphs	2010	13	.pdf	application/pdf	4883	295	86	A labeling of a graph G = (V, E) is an assignment f of distinct nonnegative integers to the vertices of G; it is an indexer of G if the induced ’edge function’ f + : E(G)→ N, from E(G) into the set N of natural numbers, defined by the rule: f +(uv) = f (u) + f (v), ∀ uv ∈ E(G), is also injective. It is known that every finite graph has an indexer; hence, an indexer f is said to be optimal if f [G] := maxv∈V (G){ f (v)} has the least possible value υ(G) amongst all the indexers of G. Clearly, υ(G) ≥ |V (G)| for any graph G with a countable number of vertices.	cache/ejpam-577.pdf	txt/ejpam-577.txt