Crossing numbers of Sierpiński‐like graphs
From MaRDI portal
Publication:5711776
DOI10.1002/jgt.20107zbMath1077.05030OpenAlexW3211451895MaRDI QIDQ5711776
Publication date: 8 December 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20107
Related Items (28)
New results on variants of covering codes in Sierpiński graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ The average eccentricity of Sierpiński graphs ⋮ Constructions of universalized Sierpiński graphs based on labeling manipulations ⋮ Coloring Hanoi and Sierpiński graphs ⋮ The Hanoi graph \(H_4^3\) ⋮ The Graovac-Pisanski index of Sierpiński graphs ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ The hub number of Sierpiński-like graphs ⋮ Metric properties of Sierpiński-like graphs ⋮ Coloring the square of Sierpiński graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ A survey of graphs with known or bounded crossing numbers ⋮ Degree sequence of the generalized Sierpiński graph ⋮ Some algebraic properties of Sierpiński-type graphs ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ The outer-connected domination number of Sierpiński-like graphs
Cites Work
This page was built for publication: Crossing numbers of Sierpiński‐like graphs