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

DOI10.1007/S00224-015-9621-9MaRDI QIDQ255280zbMATH OpenOpenAlexFDO

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

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 setouter-connected dominationSierpiński graphsSierpiński-like graphsextended Sierpiński graphs

Mathematics Subject Classification ID

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

Recommendations

• The outer-connected domination number of a graph
• On the number of outer connected dominating sets of graphs
• On the outer-connected domination in graphs
• On the total outer-connected domination in graphs
• scientific article; zbMATH DE number 5823716
• Generalization of the total outer-connected domination in graphs
• The domination number of connected graphs
• Outer-\(k\)-connected component domination in graphs
• Total outer-connected domination subdivision numbers in graphs
• Global outer connected domination number of a graph

Cites work

• scientific article; zbMATH DE number 5823716 (Why is no real title available?)
• scientific article; zbMATH DE number 1984022 (Why is no real title available?)
• scientific article; zbMATH DE number 5043398 (Why is no real title available?)
• 1-perfect codes in Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Computing a minimum outer-connected dominating set for the class of chordal graphs
• Crossing numbers of Sierpiński‐like graphs
• Global strong defensive alliances of Sierpiński-like graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• 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)\)
• On the outer-connected domination in graphs
• Pascal's Triangle and the Tower of Hanoi
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The average distance on the Sierpiński gasket
• The average eccentricity of Sierpiński graphs
• The hub number of Sierpiński-like graphs
• The outer-connected domination number of a graph
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs

Cited in

(4)

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

This page was built for publication: The outer-connected domination 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 Q255280)