Global strong defensive alliances of Sierpiński-like graphs
From MaRDI portal
Publication:372953
DOI10.1007/S00224-012-9423-2zbMATH Open1273.05164OpenAlexW2028219352MaRDI QIDQ372953FDOQ372953
Authors: Chien-Hung Lin, Jia-Jie Liu, Yue-Li Wang 
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
Recommendations
dominating setsglobal defensive alliancesSierpiński graphsSierpiński-like graphsextended Sierpiński graphs
Cites Work
- 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
- On some metric properties of the Sierpiński graphs \(S(n,k)\)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Title not available (Why is that?)
- 1-perfect codes in Sierpiński graphs
- Pascal's Triangle and the Tower of Hanoi
- Title not available (Why is that?)
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- The hub number of Sierpiński-like graphs
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- Global defensive alliances in star graphs
- Global defensive alliances in graphs
- On defensive alliances and line graphs
- Title not available (Why is that?)
- Lower bounds for global alliances of planar graphs
- Spectral study of alliances in graphs
- Security in graphs
- Offensive alliances in cubic graphs
- Global offensive alliances in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Offensive alliances in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Packing chromatic number of base-3 Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- The outer-connected domination number of Sierpiński-like graphs
- Metric properties of Sierpiński triangle graphs
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- Alliances and Related Domination Parameters
- Structural properties of subdivided-line graphs
- Feedback vertex number of Sierpiński-type graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
This page was built for publication: Global strong defensive alliances of Sierpiński-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372953)
