Monotonicity and expansion of global secure sets

DOI10.1016/J.DISC.2012.03.022MaRDI QIDQ1761464zbMATH OpenOpenAlexFDO

Authors Katarzyna Jesse-Józefczyk

Publication date 15 November 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.03.022

zbMATH Keywords

\(k\)-treesco-quasi-threshold graphdominating setfixed cardinalityglobal secure setweakly quasi-threshold graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Global secure sets of grid-like graphs
• Global secure domination in graphs
• The possible cardinalities of global secure sets in cographs
• Bounds on global secure sets in cactus trees
• Global security in claw-free cubic graphs

Cites work

• A Linear Recognition Algorithm for Cographs
• A simple linear time algorithm for cograph recognition
• A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
• Bounds on a graph's security number
• Complement reducible graphs
• Laplacian spectrum of weakly quasi-threshold graphs
• On a graph's security number
• On simple characterizations of k-trees
• Security in graphs
• Security number of grid-like graphs
• The possible cardinalities of global secure sets in cographs

Cited in

(5)

• On the security number of the Cartesian product of graphs
• 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

This page was built for publication: Monotonicity and expansion of global secure sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761464)