The possible cardinalities of global secure sets in cographs

DOI10.1016/j.tcs.2011.10.004zbMath1235.05106OpenAlexW2000263432MaRDI QIDQ764303

Katarzyna Jesse-Józefczyk

Publication date: 13 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.004

zbMATH Keywords

dominating setlinear-time algorithmcograph\(\gamma _{s}\)-monotone graphglobal secure setminimim cardinalitytrivially perfect graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The security number of strong grid-like graphs ⋮ Global security in claw-free cubic graphs ⋮ Secure sets and their expansion in cubic graphs ⋮ The security number of lexicographic products ⋮ On the security number of the Cartesian product of graphs ⋮ Monotonicity and expansion of global secure sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security number of grid-like graphs
• Global defensive alliances in star graphs
• On a graph's security number
• Complement reducible graphs
• Trivially perfect graphs
• Modular decomposition and transitive orientation
• Global defensive alliances in graphs
• Security in graphs
• Bounds on a graph's security number
• Efficient and Practical Algorithms for Sequential Modular Decomposition
• A Linear Recognition Algorithm for Cographs
• Global alliances and independence in trees