On some metric properties of the Sierpiński graphs S(n,k)

MaRDI QIDQ3073555zbMATH OpenFDO

Authors Daniele Parisse

Publication date 11 February 2011

zbMATH Keywords

chromatic numbergraph diametergraph radiustower of Hanoilinear Diophantine equationgraph centreSierpiński graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Linear Diophantine equations (11D04)

Recommendations

• The average eccentricity of Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
• Open problems for Hanoi and Sierpiński graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

Cited in

(38)

• The linear \(t\)-colorings of Sierpiński-like graphs
• scientific article; zbMATH DE number 5043398 (Why is no real title available?)
• Metric properties of Sierpiński-like graphs
• Sierpiński products of \(r\)-uniform hypergraphs
• A survey and classification of Sierpiński-type graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• The Wiener index of Sierpiński-like graphs
• The outer-connected domination number of Sierpiński-like graphs
• Global strong defensive alliances of Sierpiński-like graphs
• The hub number of Sierpiński-like graphs
• On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Security in Sierpiński graphs
• The average eccentricity of Sierpiński graphs
• Shortest paths in Sierpiński graphs
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Metric properties of Sierpiński triangle graphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Open problems for Hanoi and Sierpiński graphs
• On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
• The median of Sierpiński graphs
• Degree sequence of the generalized Sierpiński graph
• On generalized Sierpiński graphs
• Properties of Sierpinski triangle graphs
• Metric compactification of infinite Sierpiński carpet graphs
• Precious metal sequences and Sierpiński-type graphs
• Recognizing generalized Sierpiński graphs
• The Hanoi graph \(H_4^3\)
• The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
• The hamiltonicity and path t-coloring of Sierpiński-like graphs
• The Sierpiński product of graphs
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Some properties of the generalized Sierpiński gasket graphs
• Coloring Hanoi and Sierpiński graphs
• Feedback vertex number of Sierpiński-type graphs
• On the diameters and radii of the extended Sierpiński graphs
• Coloring the square of Sierpiński graphs

This page was built for publication: On some metric properties of the Sierpiński graphs \(S(n,k)\)

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