Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with graph-domination
Search options answers only
not deleted
user 68847
Given a graph $G$, a dominating set is a set of vertices $D$ such that every vertex of $G$ is in $D$ or adjacent to a vertex in $D$.
2
votes
Accepted
Independent domination number for grid graphs
The independent domination number of grid graphs is known. You can find what you are looking for in the following paper.
S. Crevals and P.R.J. Ostergard, Independent domination of grids, Discrete Mat …
- 131