Number of connected spanning subgraphs on the Sierpiński gasket

zbMATH Open1196.05040arXiv0806.0701MaRDI QIDQ3575445FDOQ3575445

Authors: Lung-Chi Chen, Shu-Chiuan Chang 

Publication date: 27 July 2010

Abstract: We study the number of connected spanning subgraphs $f_{d,b}(n)$ on the generalized Sierpinski gasket $S{G}_{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 $z_{S{G}_{d,b}}=li{m}_{voinfty}ln{f}_{d,b}(n)/v$ where $v$ is the number of vertices, on $S{G}_{2,b}(n)$ with $b=2,3,4$ are derived in terms of the results at a certain stage. The numerical values of $z_{S{G}_{d,b}}$ are obtained.

Full work available at URL: https://arxiv.org/abs/0806.0701

Recommendations

• scientific article; zbMATH DE number 5279431
• Spanning trees on the Sierpinski gasket
• Spanning trees of finite Sierpiński graphs
• Acyclic orientations on the Sierpinski gasket
• Connective constant of SAWs on the Sierpinski gasket family

zbMATH Keywords

asymptotic growth constantrecursion relationsconnected spanning subgraphsSierpiński gasket

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited In (9)

• Connective constant of SAWs on the Sierpinski gasket family
• Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
• Structure of spanning trees on the two-dimensional Sierpiński gasket
• On the number of connected subgraphs of graphs
• The intrinsic metric and geodesics on the Sierpinski gasket \(SG(3)\)
• Tutte polynomial of pseudofractal scale-free web
• Spanning trees on the Sierpinski gasket
• Interacting dimers on a Sierpinski gasket
• Acyclic orientations on the Sierpinski gasket

This page was built for publication: Number of connected spanning subgraphs on the Sierpiński gasket

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575445)