Pitchfork domination in graphs
From MaRDI portal
Recommendations
Cites work
- \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
- \([1,2]\)-domination in graphs
- \([1,2]\)-sets in graphs
- A survey of stratified domination in graphs
- Basic graph theory
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On -domination in graphs
Cited in
(11)- New parameter of inverse domination in graphs
- Doubly connected bi-domination in graphs
- Total pitchfork domination and its inverse in graphs
- Equality co-neighborhood domination in graphs
- Captive domination in graphs
- Tadpole domination number of graphs
- Applying the (1,2)-pitchfork domination and it's inverse on some special graphs
- Some modified types of pitchfork domination and it's inverse
- Some new results on captive dominating sets in graphs
- Fair detour domination of graphs
- Analyzing restrained pitchfork domination across path-related graph structures
This page was built for publication: Pitchfork domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965891)
