Sierpiński graphs as spanning subgraphs of Hanoi graphs-Reference-Cited by-同舟云学术

Sierpiński graphs as spanning subgraphs of Hanoi graphs

Published:2013-01-01 Issue:6 Volume:11 Page:
ISSN:2391-5455
Container-title:Open Mathematics
language:
Short-container-title:

Author:

Hinz Andreas,Klavžar Sandi,Zemljič Sara

Abstract

AbstractHanoi graphs H pn model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs S pn arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that S pn embeds as a spanning subgraph into H pn if and only if p is odd or, trivially, if n = 1.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.2478/s11533-013-0227-7.pdf

Reference15 articles.

1. Coloring Hanoi and Sierpinski graphs http dx org;Hinz;Discrete Math,2012

2. Coloring and counting on the Tower of Hanoi graphs http dx org;Arett;Math Mag,2010

3. Completeness of the Lipscomb universal space;Milutinovic;Glas Mat,1992

4. Equitable labelings of Sierpinski graphs;Fu;Australas,2010

5. Covering codes in Sierpinski graphs;Beaudou;Discrete Math Theor Comput Sci,2010

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Sierpiński product of graphs;Ars Mathematica Contemporanea;2022-09-01

2. The Hanoi graph H^{3}_{4};Discussiones Mathematicae Graph Theory;2020

3. A survey and classification of Sierpiński-type graphs;Discrete Applied Mathematics;2017-01

4. On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs;Open Mathematics;2016-01-01

5. Structural properties of subdivided-line graphs;Journal of Discrete Algorithms;2015-03