The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)

CORC > 兰州理工大学 > 兰州理工大学

	The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)
	Golin, Mordecai J.3; Yong, Xuerong 2; Zhang, Yuanping 1
	2007
页码	242-+
英文摘要	Let T(G) be the number of spanning trees in graph G. In this note we explore the asymptotics of T(G) for circulant graphs.
会议录	PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS
会议录出版者	SIAM
会议录出版地	3600 UNIV CITY SCIENCE CENTER, PHILADELPHIA, PA 19104-2688 USA
语种	英语
资助项目	Hong Kong CERG[HKUST 6131/05]
WOS研究方向	Computer Science ; Mathematics
WOS记录号	WOS:000289653700024
内容类型	会议论文
源URL	[http://119.78.100.223/handle/2XXMBERH/38209]
专题	兰州理工大学
通讯作者	Golin, Mordecai J.
作者单位	1.Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Gansu, Peoples R China 2.Univ Puerto Rico, Dept Math Sci, Mayaguez, PR 00681 USA 3.Hong Kong UST, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
推荐引用方式 GB/T 7714	Golin, Mordecai J.,Yong, Xuerong,Zhang, Yuanping. The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)[C]. 见:.