Number of connected spanning subgraphs on the Sierpinski gasket - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2009

Number of connected spanning subgraphs on the Sierpinski gasket

Résumé

We study the number of connected spanning subgraphs f(d,b) (n) on the generalized Sierpinski gasket SG(d,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) = lim(v ->infinity) ln f(d,b)(n)/v where v is the number of vertices, on SG(2,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.
Fichier principal
Vignette du fichier
992-4084-1-PB.pdf (202.99 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00988182 , version 1 (07-05-2014)

Identifiants

Citer

Shu-Chiuan Chang, Lung-Chi Chen. Number of connected spanning subgraphs on the Sierpinski gasket. Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 1 (1), pp.55--77. ⟨10.46298/dmtcs.470⟩. ⟨hal-00988182⟩

Collections

TDS-MACS
63 Consultations
868 Téléchargements

Altmetric

Partager

More