Pages that link to "Item:Q2391669"
From MaRDI portal
The following pages link to New results on variants of covering codes in Sierpiński graphs (Q2391669):
Displayed 17 items.
- Information retrieval and the average number of input clues (Q514538) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- Metric properties of generalized Sierpiński graphs over stars (Q2026318) (← links)
- On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs (Q2067747) (← links)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks (Q2283166) (← links)
- On generalized Sierpiński graphs (Q2364078) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs (Q2420418) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- Italian domination on Mycielskian and Sierpinski graphs (Q5013489) (← links)
- On the roman domination number of generalized Sierpiński graphs (Q5023115) (← 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)