Global strong defensive alliances of Sierpiński-like graphs

DOI10.1007/S00224-012-9423-2MaRDI QIDQ372953zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dominating setsglobal defensive alliancesSierpiń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

• Global defensive alliances in graphs
• Strong alliances in graphs
• On global (strong) defensive alliances in some product graphs
• Global defensive alliances in trees
• Lower bounds for global alliances of planar graphs

Cites work

• scientific article; zbMATH DE number 1984022 (Why is no real title available?)
• scientific article; zbMATH DE number 2076807 (Why is no real title available?)
• scientific article; zbMATH DE number 2077650 (Why is no real title available?)
• scientific article; zbMATH DE number 2170476 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• scientific article; zbMATH DE number 5043398 (Why is no real title available?)
• scientific article; zbMATH DE number 5056647 (Why is no real title available?)
• 1-perfect codes in Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Crossing numbers of Sierpiński‐like graphs
• Global defensive alliances in graphs
• Global defensive alliances in star graphs
• Global offensive alliances in graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Lower bounds for global alliances of planar graphs
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Offensive alliances in cubic graphs
• Offensive alliances in graphs
• On defensive alliances and line graphs
• On some metric properties of the Sierpiński graphs \(S(n,k)\)
• Pascal's Triangle and the Tower of Hanoi
• Security in graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• Spectral study of alliances in graphs
• The average distance on the Sierpiński gasket
• The average eccentricity of Sierpiński graphs
• The hub number of Sierpiński-like graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs

Cited in

(9)

• Alliances and Related Domination Parameters
• Structural properties of subdivided-line graphs
• The outer-connected domination number of Sierpiński-like graphs
• The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
• Feedback vertex number of Sierpiński-type graphs
• A survey and classification of Sierpiński-type graphs
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Packing chromatic number of base-3 Sierpiński graphs
• Metric properties of Sierpiński triangle 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)