On the connected safe number of some classes of graphs
Summary: For a connected simple graph \(\mathscr{G}\), a nonempty subset \(\mathscr{S}\) of \(V(\mathscr{G})\) is a connected safe set if the induced subgraph \(\mathscr{G}[ \mathscr{S}]\) is connected and the inequality \(|\mathscr{S}|\geq|\mathscr{D}|\) satisfies for each connected component \(\mathscr{D}\) of \(\mathscr{G}\setminus\mathscr{S}\) whenever an edge of \(\mathscr{G}\) exists between \(\mathscr{S}\) and \(\mathscr{D}\). A connected safe set of a connected graph \(\mathscr{G}\) with minimum cardinality is called the minimum connected safe set and that minimum cardinality is called the connected safe numbers. We study connected safe sets with minimal cardinality of the ladder, sunlet, and wheel graphs.
- A new formulation for the safe set problem on graphs
- Approximating connected safe sets in weighted trees
- Graphs \& digraphs
- scientific article; zbMATH DE number 6986946 (Why is no real title available?)
- On the weighted safe set problem on paths and cycles
- Ottimizzazione Combinatoria
- Parameterized complexity of safe set
- Power domination number of sunlet graph and other graphs
- Safe number and integrity of graphs
- Safe set problem on graphs
- Safe sets in graphs: graph classes and structural parameters
- Safe sets, network majority on weighted trees
- Stable structure on safe set problems in vertex-weighted graphs
This page was built for publication: On the connected safe number of some classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051722)
