Repetitive Pattern of L(2,1)-Labelling on Sierpinski Graphs
Yuri C Sagala, Susilo Hariyanto, SRRM Titi Udjiani, Muhammad Rafid Fadil · 2020
An L(2,1)-labelling of a graph G is a function f which assigns labels from {0,1,…,λ} to the vertices of G such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart.Sierpiński graphs S(n,k) generalized the Tower of Hanoi graphs that constructed by copying complete graphs recursively.By Chang-Kuo algorithm, we will show L(2,1)-labelling of Sierpinski graphs and repetitive pattern on it.