Induced subgraphs of gamma graphs
From MaRDI portal
Recommendations
Cited in
(13)- Bounds on co-independent liar's domination in graphs
- Reinforcement number of a graph with respect to half-domination
- Irredundance graphs
- Which graphs occur as \(\gamma\)-graphs?
- Introduction to reconfiguration
- Irredundance trees of diameter 3
- Split domination number of divisible dominating graphs
- Neighborhood outer split domination in graphs
- Modified \(\gamma\)-graph \(G(\gamma_m)\) of some special graphs
- The gamma graph of a graph
- \(\Gamma\)-paired dominating graphs of some paths and some cycles
- -total dominating graphs of lollipop, umbrella, and coconut graphs
- Reconfiguring minimum independent dominating sets in graphs
This page was built for publication: Induced subgraphs of gamma graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864854)