Codes and \(L(2,1)\)-labelings in Sierpiński graphs

DOI10.11650/twjm/1500407890zbMath1093.05059OpenAlexW4247282291MaRDI QIDQ2493639

Sylvain Gravier, Sandi Klavžar, Michel Mollard

Publication date: 26 June 2006

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500407890

zbMATH Keywords

perfect codesSierpiński graphs\(\lambda\)-numbercodes in graphs\(L(2,1)\)-labelings

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Related Items

New results on variants of covering codes in Sierpiński graphs ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Finding the edge ranking number through vertex partitions ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Metric properties of Sierpiński-like graphs ⋮ Coloring the square of Sierpiński graphs ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ The Wiener index of Sierpiński-like graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ Feedback vertex number of Sierpiński-type graphs