Global strong defensive alliances of Sierpiński-like graphs
From MaRDI portal
Publication:372953
DOI10.1007/s00224-012-9423-2zbMath1273.05164OpenAlexW2028219352MaRDI QIDQ372953
Chien-Hung Lin, Yue-Li Wang, Jia-Jie Liu
Publication date: 21 October 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-012-9423-2
extended Sierpiński graphsSierpiński graphsSierpiński-like graphsdominating setsglobal defensive alliances
Related Items (9)
Packing chromatic number of base-3 Sierpiński graphs ⋮ Metric properties of Sierpiński triangle graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Structural properties of subdivided-line graphs ⋮ Alliances and Related Domination Parameters ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ The outer-connected domination number of Sierpiński-like graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Global defensive alliances in star graphs
- The average distance on the Sierpiński gasket
- Global defensive alliances in graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The average eccentricity of Sierpiński graphs
- Security in graphs
- On defensive alliances and line graphs
- Offensive alliances in cubic graphs
- Global offensive alliances in graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Offensive alliances in graphs
- 1-perfect codes in Sierpiński graphs
- Pascal's Triangle and the Tower of Hanoi
- Spectral study of alliances in graphs
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
This page was built for publication: Global strong defensive alliances of Sierpiński-like graphs
