Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph

DOI10.1016/j.tcs.2017.03.009zbMath1369.05164arXiv1703.09023OpenAlexW2595972220MaRDI QIDQ526869

Liren Shan, Zhong-Zhi Zhang, Hu-An Li

Publication date: 15 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09023

zbMATH Keywords

domination numbercomplex networkscale-free networkSierpiński graphminimum dominating set

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB ⋮ Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket ⋮ Applications of Markov spectra for the weighted partition network by the substitution rule ⋮ Combinatorial properties of Farey graphs

Cites Work

• Unnamed Item
• Enumerating minimal connected dominating sets in graphs of bounded chordality
• Inapproximability of dominating set on power law graphs
• On the number of minimal dominating sets on some graph classes
• Statistical mechanics of the minimum dominating set problem
• On dominating sets of maximal outerplanar and planar graphs
• Matching theory
• Dominating sets in planar graphs
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Combinatorial bounds via measure and conquer
• Dominating sets in triangulations on surfaces
• On the Enumeration of Minimal Dominating Sets and Related Notions
• A dominating-set-based routing scheme in ad hoc wireless networks

This page was built for publication: Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph