scientific article; zbMATH DE number 6253993

zbMath1280.05130MaRDI QIDQ5396737

Matjaž Kovše, Sylvain Gravier, Michel Mollard, Laurent Beaudou, Sandi Klavžar

Publication date: 3 February 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1283/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

perfect codesSierpiński graphscodes in graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Related Items (12)

New results on variants of covering codes in Sierpiński graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ 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 ⋮ 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 ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Degree sequence of the generalized Sierpiński graph

This page was built for publication: