The hub number of Sierpiński-like graphs
DOI10.1007/S00224-010-9286-3zbMATH Open1234.05178OpenAlexW2050835594MaRDI QIDQ649112FDOQ649112
Authors: Chien-Hung Lin, Jia-Jie Liu, Yue-Li Wang, William Chung-Kung Yen
Publication date: 30 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9286-3
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Fractals (28A80)
Cites Work
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- The average distance on the Sierpiński gasket
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- On some metric properties of the Sierpiński graphs \(S(n,k)\)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- Pascal's Triangle and the Tower of Hanoi
- Title not available (Why is that?)
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- Title not available (Why is that?)
- The hub number of a graph
Cited In (27)
- Metric properties of Sierpiński-like graphs
- HUB PARAMETERS AND MYCIELSKIAN OF A GRAPH
- Generalized power domination: propagation radius and Sierpiński graphs
- A survey and classification of Sierpiński-type 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, girth and Mycielski graphs
- Shortest paths in Sierpiński graphs
- Title not available (Why is that?)
- Metric properties of Sierpiński triangle graphs
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- The hub number of co-comparability graphs
- Degree sequence of the generalized Sierpiński graph
- The minimum number of hubs in networks
- Minimum Linear Arrangement of Generalized Sierpinski Graphs
- 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 hub number of a graph
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- Structural properties of subdivided-line graphs
- Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
- Title not available (Why is that?)
- Feedback vertex number of Sierpiński-type graphs
- On the diameters and radii of the extended Sierpiński graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring the square of Sierpiński graphs
This page was built for publication: The hub number of Sierpiński-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649112)