Pages that link to "Item:Q1025971"
From MaRDI portal
The following pages link to On the \(\{k\}\)-domination number of Cartesian products of graphs (Q1025971):
Displaying 23 items.
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers (Q520432) (← links)
- The Menger number of the Cartesian product of graphs (Q628251) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- The \(\{k\}\)-domatic number of a graph (Q719648) (← links)
- On the Colin de Verdière numbers of Cartesian graph products (Q1039738) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- 3-tuple total domination number of Rook's graphs (Q2062669) (← links)
- Integer domination of Cartesian product graphs (Q2339441) (← links)
- Alliance free sets in Cartesian product graphs (Q2446344) (← links)
- On Clark and Suen bound-type results for<i>k</i>-domination and Roman domination of Cartesian product graphs (Q2852110) (← links)
- Graph products and integer domination. II (Q2869413) (← links)
- Vizing's conjecture: a survey and recent results (Q3113279) (← links)
- (Open) packing number of some graph products (Q3386621) (← links)
- (Q4380654) (← links)
- (Q4949819) (← links)
- Bounds for complete cototal domination number of Cartesian product graphs and complement graphs (Q5063261) (← links)
- From Italian domination in lexicographic product graphs to w-domination in graphs (Q5066972) (← links)
- Cartesian product graphs and k-tuple total domination (Q5086876) (← links)
- On density of subgraphs of Cartesian products (Q5110645) (← links)
- (Q5206444) (← links)
- The integer {k}-domination number of circulant graphs (Q5858164) (← links)
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
