| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653804 | European Journal of Combinatorics | 2012 | 10 Pages |
Abstract
⺠We study efficiently dominated vertex-transitive cubic graphs. ⺠Up to a Möbius ladder, every vertex-transitive cubic graph on 2n vertices admits efficient domination. ⺠We apply algebraic approach to domination in graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Martin Knor, Primož PotoÄnik,