Number of connected spanning subgraphs on the Sierpinski gasket

題名	Number of connected spanning subgraphs on the Sierpinski gasket
作者	張書銓 Chang, Shu-Chiuan 陳隆奇 Lung-Chi Chen
貢獻者	應數系
日期	2009.04
上傳時間	13-Nov-2014 17:22:40 (UTC+8)
摘要	We study the number of connected spanning subgraphs fd,b(n) on the generalized Sierpinski gasket SGd,b(n) at stage n with dimension d equal to two, three and four for b=2, and layer b equal to three and four for d=2. The upper and lower bounds for the asymptotic growth constant, defined as zSGd,b=limv →∞ ln fd,b(n)/v where v is the number of vertices, on SG2,b(n) with b=2,3,4 are derived in terms of the results at a certain stage. The numerical values of zSGd,b are obtained.
關聯	Discrete Mathematics & Theoretical Computer Science, 11(1), 55-78
資料類型	article

dc.contributor	應數系	en_US
dc.creator (作者)	張書銓	zh_TW
dc.creator (作者)	Chang, Shu-Chiuan	en_US
dc.creator (作者)	陳隆奇	zh_TW
dc.creator (作者)	Lung-Chi Chen	zh_TW
dc.date (日期)	2009.04	en_US
dc.date.accessioned	13-Nov-2014 17:22:40 (UTC+8)	-
dc.date.available	13-Nov-2014 17:22:40 (UTC+8)	-
dc.date.issued (上傳時間)	13-Nov-2014 17:22:40 (UTC+8)	-
dc.identifier.uri (URI)	http://nccur.lib.nccu.edu.tw/handle/140.119/71417	-
dc.description.abstract (摘要)	We study the number of connected spanning subgraphs fd,b(n) on the generalized Sierpinski gasket SGd,b(n) at stage n with dimension d equal to two, three and four for b=2, and layer b equal to three and four for d=2. The upper and lower bounds for the asymptotic growth constant, defined as zSGd,b=limv →∞ ln fd,b(n)/v where v is the number of vertices, on SG2,b(n) with b=2,3,4 are derived in terms of the results at a certain stage. The numerical values of zSGd,b are obtained.	en_US
dc.format.extent	278656 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en_US	-
dc.relation (關聯)	Discrete Mathematics & Theoretical Computer Science, 11(1), 55-78	en_US
dc.title (題名)	Number of connected spanning subgraphs on the Sierpinski gasket	en_US
dc.type (資料類型)	article	en