Hamming dimension of a graph-the case of Sierpiński graphs

DOI10.1016/j.ejc.2012.09.006zbMath1254.05046OpenAlexW2042176113MaRDI QIDQ691596

Sandi Klavžar, Iztok Peterin, Sara Sabrina Zemljič

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.09.006

zbMATH Keywords

Sierpiński triangle graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (16)

On generalized Sierpiński graphs ⋮ Metric properties of Sierpiński triangle graphs ⋮ On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ Coloring the square of Sierpiński graphs ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ On distances in generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Degree sequence of the generalized Sierpiński graph ⋮ On the treewidth of Hanoi graphs ⋮ Induced Embeddings into Hamming Graphs. ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ On the roman domination number of generalized Sierpiński graphs

This page was built for publication: Hamming dimension of a graph-the case of Sierpiński graphs