课题基金 / 基金详情

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

Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints
度和距离约束下改进大图阶的上下界
批准号:
DP0450294
负责人:
Prof Mirka Miller
金额:
$17.46万
依托单位国家:
澳大利亚
项目类别:
Discovery Projects
财政年份:
2004
资助国家:
澳大利亚
项目状态:
已结题
起止时间:
2004-07-31 至 2008-07-01

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
网络支配着社会的方方面面,包括交通网络、通信网络、计算机网络和货物分配网络等--对这些网络的理论分析已成为一项具有根本重要性的课题。网络可以用图形来建模。该项目将提供新的理论结果,将提高我们对网络拓扑的了解。然后,新的知识将被用于关于给定的最大度和距离约束的大图的构造。
英文摘要
Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution 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 network topologies. The new knowledge will then be utilised in the construction of large graphs with respect to given maximum degree and distance constraints.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
海外基金