Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints

Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distributions of goods etc. and the theoretical analysis of such networks has become a subject of fundamental importance. networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of netwok topologies. The new knowledge will then be utlisied in hte construction of large graphs with respect to given maximum degree and distance constraints.