Domination in 4-regular Knödel graphs
A subset D of vertices of a graph G is a dominating set if for each u ∈ V(G) ∖ D, u is adjacent to some vertex v ∈ D. The domination number, γ(G) of G, is the minimum cardinality of a dominating set of G. For an even integer n ≥ 2 and 1 ≤ Δ ≤ ⌊log2n⌋, a Knödel graph WΔ, n is a Δ-regular bipartite gr...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2018-08-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2018-0072 |