33
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Peg solitaire game on Sierpinski graphs

, , &
Pages 2249-2258 | Received 01 Nov 2019, Published online: 11 Mar 2021

References

  • Robert A. Beeler and Aaron D. Gray, Freely solvable graphs in peg solitaire, ISRN Combinatorics 2013 (2013), 1–6.
  • Robert A. Beeler, Hannah Green, and Russell T. Harper, Peg solitaire on caterpillars, Integers 17 (2017), Paper No. G1, 14. MR 3619677
  • Robert A. Beeler and D. Paul Hoilman, Peg solitaire on the windmill and the double star graphs, Australas. J. Combin. 53 (2012), 127–134. MR 2961977
  • Robert A. Beeler and D. Paul Hoilman, Peg solitaire on graphs, Discrete Math. 311 (2011), no. 20, 2198–2202. MR 2825664 doi: 10.1016/j.disc.2011.07.006
  • Robert A. Beeler and Tony K. Rodriguez, Fool’s solitaire on graphs, Involve 5 (2012), no. 4, 473–480. MR 3069049 doi: 10.2140/involve.2012.5.473
  • Robert A. Beeler and Clayton A. Walvoort, Peg solitaire on trees with diameter four, Australas. J. Combin. 63 (2015), 321–332. MR 3414067
  • Nazlican Cakmak, Emrah Akyar, and Nilay Torun, Peg solitaire on Sierpinski graphs, Book of Abstracts of The IV International Conference on Engineering and Natural Sciences (ICENS) (Ukraine), 02-06 MAY 2018, pp. 306–306.
  • John Engbers and Ryan Weber, Merging peg solitaire on graphs, Involve 11 (2018), no. 1, 53–66. MR 3681347 doi: 10.2140/involve.2018.11.53
  • Andreas M. Hinz, Sandi Klavžar, Uroš Milutinović, and Ciril Petr, The tower of Hanoi—myths and maths, Birkhäuser/Springer Basel AG, Basel, 2013.
  • Shin Min Kang, Adnan Asghar, Haseeb Ahmad, and Young Chel Kwun, Irregularity of Sierpinski graph, Journal of Discrete Mathematical Sciences and Cryptography 22 (2019), no. 7, 1269–1280. doi: 10.1080/09720529.2019.1698186
  • Sarah Loeb and Jennifer Wise, Fool’s solitaire on joins and Cartesian products of graphs, Discrete Math. 338 (2015), no. 3, 66–71. MR 3291868 doi: 10.1016/j.disc.2014.10.022
  • Indra Rajasingh, Bharati Rajan, A. S. Shanthi, and Albert Muthumalai, Induced matching partition of Sierpinski and honeycomb networks, Informatics Engineering and Information Science (Berlin, Heidelberg) (Azizah Abd Manaf, Shamsul Sahibuddin, Rabiah Ahmad, Salwani Mohd Daud, and Eyas El-Qawasmeh, eds.), Springer Berlin Heidelberg, 2011, pp. 390–399.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.