The following pages link to A note on total domination (Q1065020):
Displaying 23 items.
- On the ratio between 2-domination and total outer-independent domination numbers of trees (Q379903) (← links)
- Conical and spherical graphs (Q444416) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- Some inequalities about connected domination number (Q1126207) (← links)
- Regular totally domatically full graphs (Q1174127) (← links)
- The least point covering and domination numbers of a graph (Q1174131) (← links)
- The diversity of domination (Q1356420) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- An algorithm for prescribed multiple domination in arbitrary graphs (Q1608446) (← links)
- Universal minimal total dominating functions of trees (Q1893182) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Minus total domination in graphs (Q3070166) (← links)
- On equality in an upper bound for domination parameters of graphs (Q3122896) (← links)
- Irredundance (Q3384112) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- Bounds on a generalized domination parameter (Q3491607) (← links)
- An inner model for global domination (Q3616352) (← links)
- Convexity of minimal total dominating functions in graphs (Q6085723) (← links)
