Pages that link to "Item:Q2446883"
From MaRDI portal
The following pages link to Bounds on the connected domination number of a graph (Q2446883):
Displaying 15 items.
- Some comments on the Slater number (Q526227) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- The hub number, girth and Mycielski graphs (Q2015153) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- Disprove of a conjecture on the doubly connected domination subdivision number (Q2169241) (← links)
- Connected domination in maximal outerplanar graphs (Q2192107) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Traceability of connected domination critical graphs (Q2656675) (← links)
- Connected Domination (Q3384607) (← links)
- On domination-type invariants of Fibonacci cubes and hypercubes (Q4577877) (← links)
- On the sum of the total domination numbers of a digraph and its converse (Q4622851) (← links)
- Domination parameters on Cayley digraphs of transformation semigroups with fixed sets (Q5101843) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- Total domination in digraphs (Q5236071) (← links)