Pages that link to "Item:Q1692643"
From MaRDI portal
The following pages link to Domination parameters of a graph and its complement (Q1692643):
Displaying 18 items.
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Domination parameters for the bishops graph (Q1081616) (← links)
- Restrained domination in self-complementary graphs (Q2227117) (← links)
- New results on connected dominating structures in graphs (Q2283728) (← links)
- On the relations between the parameters of graphs (Q2372398) (← links)
- Extended chain of domination parameters in graphs (Q2449267) (← links)
- A note on the domination number of a graph and its complement (Q2760899) (← links)
- Existence of graphs with a given domination parameter (Q2888269) (← links)
- On the codomination number of a graph (Q3376220) (← links)
- Connected Domination (Q3384607) (← links)
- (Q3421955) (← links)
- Domination in Jahangir graph J_{2,m} (Q3508886) (← links)
- (Q4378632) (← links)
- Domination in Bipartite Graphs and in Their Complements (Q4429234) (← links)
- (Q4677915) (← links)
- Bounds for complete cototal domination number of Cartesian product graphs and complement graphs (Q5063261) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
- Domination parameters of generalized Sierpiński graphs (Q6651148) (← links)