Pages that link to "Item:Q2493639"

The following pages link to Codes and \(L(2,1)\)-labelings in Sierpiński graphs (Q2493639):

Displaying 17 items.

• Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs (Q444448) (← links)
• Coloring the square of Sierpiński graphs (Q497382) (← links)
• A survey and classification of Sierpiński-type graphs (Q516890) (← links)
• Shortest paths in Sierpiński graphs (Q741754) (← links)
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
• Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups (Q1403878) (← links)
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
• Metric properties of Sierpiński-like graphs (Q1734751) (← links)
• The Wiener index of Sierpiński-like graphs (Q1743486) (← links)
• Finding the edge ranking number through vertex partitions (Q1949112) (← links)
• The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
• Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
• The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
• New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
• Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
• (Q3984525) (← links)