Extremal graph theory for metric dimension and diameter.
Hernando, Carmen; Mora, Mercè; Pelayo, Ignacio M.; Seara, Carlos; Wood, David R. — 2010
The Electronic Journal of Combinatorics [electronic only]
Extremal graph theory for metric dimension and diameter.
Distance 2-Domination in Prisms of Graphs
A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ2(G) denote the size of a smallest distance 2-dominating set of G. For any permutation π of the vertex set of G, the prism of G with respect to π is the graph πG obtained from G and a copy G′ of G by joining u ∊ V(G) with v′ ∊ V(G′) if and only if v′ = π(u). If γ2(πG) = γ2(G) for any permutation π of V(G), then G is called a universal γ2-fixer. In this...
Page 1