The hub number of Sierpiński-like graphs
From MaRDI portal
Publication:649112
DOI10.1007/s00224-010-9286-3zbMath1234.05178MaRDI QIDQ649112
William Chung-Kung Yen, Jia-Jie Liu, Yue-Li Wang, Chien-Hung Lin
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
dominating sets; extended Sierpinski graphs; hub numbers; hub set; Sierpinski graphs; Sierpinski-like graphs
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
28A80: Fractals
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures, Degree sequence of the generalized Sierpiński graph, HUB PARAMETERS AND MYCIELSKIAN OF A GRAPH, Minimum Linear Arrangement of Generalized Sierpinski Graphs, The outer-connected domination number of Sierpiński-like graphs, Sierpiński graphs as spanning subgraphs of Hanoi graphs, Global strong defensive alliances of Sierpiński-like graphs, The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs, Coloring the square of Sierpiński graphs, A survey and classification of Sierpiński-type graphs, Shortest paths in Sierpiński graphs, Metric properties of Sierpiński-like graphs, The Wiener index of Sierpiński-like graphs, The linear \(t\)-colorings of Sierpiński-like graphs, The hub number, girth and Mycielski graphs, Structural properties of subdivided-line graphs, Metric properties of Sierpiński triangle graphs, Generalized power domination: propagation radius and Sierpiński graphs, The \((d, 1)\)-total labelling of Sierpiński-like graphs, The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs, The hub number of co-comparability graphs, Feedback vertex number of Sierpiński-type graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The hub number of a graph
- 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
- 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
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata