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 zSG d,b = limv→∞ ln f d,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 zSG d,b are obtained. © 2009 Discrete Mathematics and Theoretical Computer Science (DMTCS).
Author supplied keywords
Cite
CITATION STYLE
Chang, S. C., & Chen, L. C. (2009). Number of connected spanning subgraphs on the Sierpinski gasket. Discrete Mathematics and Theoretical Computer Science, 11(1), 55–78. https://doi.org/10.46298/dmtcs.470
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.