Pages that link to "Item:Q691596"
From MaRDI portal
The following pages link to Hamming dimension of a graph-the case of Sierpiński graphs (Q691596):
Displaying 17 items.
- An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332) (← 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)
- The edge-diametric theorem in Hamming spaces (Q947095) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Metric properties of Sierpiński triangle graphs (Q2161263) (← links)
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
- On generalized Sierpiński graphs (Q2364078) (← links)
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs (Q2420418) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- On the roman domination number of generalized Sierpiński graphs (Q5023115) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- On the zero forcing number of generalized Sierpinski graphs (Q5135721) (← links)
- Degree sequence of the generalized Sierpiński graph (Q5149418) (← links)
- On distances in generalized Sierpiński graphs (Q5155698) (← links)
- Edge general position sets in Fibonacci and Lucas cubes (Q6111323) (← links)