Equitable L(2,1)-labelings of Sierpiński graphs

zbMATH Open1196.05083MaRDI QIDQ3565864FDOQ3565864

Authors: Hong-Yong Fu, Dezheng Xie 

Publication date: 7 June 2010

Recommendations

• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Coloring the square of Sierpiński graphs
• New families of equitable graphs

zbMATH Keywords

Tower of Hanoi graphequitable labelingSierpinski graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (14)

• Metric properties of Sierpiński-like graphs
• Packing chromatic number of base-3 Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• The Wiener index of Sierpiński-like graphs
• Title not available (Why is that?)
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Shortest paths in Sierpiński graphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Degree sequence of the generalized Sierpiński graph
• On the universality and extremality of graphs with a distance constrained colouring
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• The linear \(t\)-colorings of Sierpiński-like graphs
• Coloring the square of Sierpiński graphs

This page was built for publication: Equitable \(L(2,1)\)-labelings of Sierpiński graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565864)