Monotonicity and expansion of global secure sets
From MaRDI portal
Publication:1761464
DOI10.1016/j.disc.2012.03.022zbMath1250.05080OpenAlexW1986384999MaRDI QIDQ1761464
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
dominating set\(k\)-treesfixed cardinalityglobal secure setco-quasi-threshold graphweakly quasi-threshold graph
Related Items (5)
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
Cites Work
- The possible cardinalities of global secure sets in cographs
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Security number of grid-like graphs
- Laplacian spectrum of weakly quasi-threshold graphs
- On a graph's security number
- Complement reducible graphs
- A simple linear time algorithm for cograph recognition
- On simple characterizations of k-trees
- Security in graphs
- Bounds on a graph's security number
- A Linear Recognition Algorithm for Cographs
This page was built for publication: Monotonicity and expansion of global secure sets