The following pages link to (Q3791165):
Displaying 11 items.
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On graphs with equal domination and independent domination numbers (Q1182987) (← links)
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- On graphs with equal total domination and connected domination numbers (Q2488736) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Graphs with equal domination and independent domination numbers (Q5012363) (← links)
- Construction of Halin graph with perfect k-ary tree and its independent domination number (Q5036750) (← links)
