Necessary and sufficient conditions for a simple and connected graph are given in terms of the order and size of the graph as well as the numbers ni of vertices of degree i and the numbers mij of edges with end degrees i and j.These conditions are numerous for general(n,m)-graphs but not so for chemical graphs.This model is used to find bounds on various topological indices,and in particular Adriatic indices.