Pages that link to "Item:Q659759"
From MaRDI portal
The following pages link to Connected domination number of a graph and its complement (Q659759):
Displaying 22 items.
- Inequalities of Nordhaus-Gaddum type for doubly connected domination number (Q608251) (← links)
- The connectivity of a graph and its complement (Q1003479) (← links)
- Domination parameters of a graph and its complement (Q1692643) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- Connected domsaturation number of a graph (Q1777559) (← links)
- Relating the size of a connected graph to its total and restricted domination numbers (Q1827789) (← links)
- Connected domination in maximal outerplanar graphs (Q2192107) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- The product of the restrained domination numbers of a graph and its complement (Q2452393) (← links)
- Traceability of connected domination critical graphs (Q2656675) (← links)
- Connected Domination (Q3384607) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- (Q4304592) (← links)
- (Q4913098) (← links)
- A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
- [1,2]-Complementary connected domination number of graphs-III (Q5084547) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- (Q5374243) (← links)
- (Q5407405) (← links)
- (Q5413524) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals (Q6617352) (← links)