The outer-connected domination number of Sierpiński-like graphs

DOI10.1007/S00224-015-9621-9zbMath1331.05166OpenAlexW2114204912MaRDI QIDQ255280

Jia-Jie Liu, Yue-Li Wang, Shun-Chieh Chang

Publication date: 9 March 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9621-9

zbMATH Keywords

dominating setextended Sierpiński graphsouter-connected dominationSierpiński graphsSierpiński-like graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the outer-connected domination in graphs
• Global strong defensive alliances of Sierpiński-like graphs
• The hub number of Sierpiński-like graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• 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
• The average eccentricity of Sierpiński graphs
• Computing a minimum outer-connected dominating set for the class of chordal graphs
• The Tower of Hanoi – Myths and Maths
• 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

This page was built for publication: The outer-connected domination number of Sierpiński-like graphs