5 Faculty of Natural Sciences and Mathematics [Maribor]
6 Institute of Mathematics, Physics and Mechanics [Ljubljana]
For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices such that any vertex from C has exactly a neighbors in C and any vertex not in C has exactly b neighbors in C. In this paper we classify integers a and b for which there exist (a, b)-codes in Sierpinski graphs.
Liu, Jia-Bao; Siddiqui, Hafiz Muhammad Afzal; Nadeem, Muhammad Faisal; Binyamin, Muhammad Ahsan, 2021, Some Topological Properties Of Uniform Subdivision Of SierpiĹski Graphs, Main Group Metal Chemistry, 44, 1, pp. 218-227, 10.1515/mgmc-2021-0006.