Crossing numbers of Sierpiński‐like graphs

From MaRDI portal
Publication:5711776

DOI10.1002/jgt.20107zbMath1077.05030OpenAlexW3211451895MaRDI QIDQ5711776

Bojan Mohar, Sandi Klavžar

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 graphsGlobal strong defensive alliances of Sierpiński-like graphsThe 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphsMaximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphsThe average eccentricity of Sierpiński graphsConstructions of universalized Sierpiński graphs based on labeling manipulationsColoring Hanoi and Sierpiński graphsThe Hanoi graph \(H_4^3\)The Graovac-Pisanski index of Sierpiński graphsMinimum Linear Arrangement of Generalized Sierpinski GraphsThe hamiltonicity and path \(t\)-coloring of Sierpiński-like graphsThe hub number of Sierpiński-like graphsMetric properties of Sierpiński-like graphsColoring the square of Sierpiński graphsThe Wiener index of Sierpiński-like graphsA survey and classification of Sierpiński-type graphsMaximum matchings in scale-free networks with identical degree distributionThe linear \(t\)-colorings of Sierpiński-like graphsStructural properties of subdivided-line graphsThe \((d, 1)\)-total labelling of Sierpiński-like graphsShortest paths in Sierpiński graphsA survey of graphs with known or bounded crossing numbersDegree sequence of the generalized Sierpiński graphSome algebraic properties of Sierpiński-type graphsVertex-, edge-, and total-colorings of Sierpiński-like graphsOn some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphsFeedback vertex number of Sierpiński-type graphsThe outer-connected domination number of Sierpiński-like graphs



Cites Work


This page was built for publication: Crossing numbers of Sierpiński‐like graphs