Abstract
If G is a graph and n a positive integer, then the generalized Sierpi?ski
graph SnG is a fractal-like graph that uses G as a building block. The
construction of SnG generalizes the classical Sierpi?ski graphs Sn p,
where the role of G is played by the complete graph Kp. An explicit formula
for the number of connected components in SnG is given and it is proved that
the (edge-)connectivity of SnG equals the (edge-)connectivity of G. It is
demonstrated that SnG contains a 1-factor if and only if G contains a
1-factor. Hamiltonicity of generalized Sierpi?ski graphs is also discussed.
Publisher
National Library of Serbia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献