scientific article; zbMATH DE number 2170476
From MaRDI portal
Publication:4677972
zbMATH Open1066.05100MaRDI QIDQ4677972FDOQ4677972
Authors: Robert Brigham, Stephen T. Hedetniemi, Ronald D. Dutton 
Publication date: 23 May 2005
Title of this publication is not available (Why is that?)
Recommendations
Cited In (21)
- Partitioning a graph into offensive \(k\)-alliances
- Security in graphs
- Bounds on a graph's security number
- On defensive alliance in zero-divisor graphs
- Saturated boundary \(k\)-alliances in graphs
- Partitioning a graph into defensive \(k\)-alliances
- Bandwidth and pathwidth of three-dimensional grids
- Alliance free sets in Cartesian product graphs
- Global strong defensive alliances of Sierpiński-like graphs
- Global defensive \(k\)-alliances in graphs
- Global defensive alliances in star graphs
- Defensive \(k\)-alliances in graphs
- Boundary defensive \(k\)-alliances in graphs
- Security number of grid-like graphs
- On a graph's security number
- Alliances and Related Domination Parameters
- Global defensive alliances in the lexicographic product of paths and cycles
- On the global powerful alliance number of zero-divisor graphs of finite commutative rings
- Alliances in graphs: parameters, properties and applications -- a survey
- Offensive \(r\)-alliances in graphs
- Partitioning a graph into global powerful \(k\)-alliances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677972)
