Distance 2-Domination in Prisms of Graphs

Open access


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 work we characterize the cycles and paths that are universal γ2-fixers.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] C.M. Mynhardt and Z. Xu Domination in prisms of graphs: universal fixers Util. Math. 78 (2009) 185-201.

  • [2] M. Lemańska and R. Zuazua Convex universal fixers Discuss. Math. Graph Theory 32 (2012) 807-812. doi:

    • Crossref
    • Export Citation
  • [3] A. Meir and J.W. Moon Relations between packing and covering number of a tree Pacific J. Math. 61 (1975) 225-233. doi:

    • Crossref
    • Export Citation
  • [4] C.M. Mynhardt and M. Schurch Paired domination in prisms of graphs Discus. Math. Graph Theory 31 (2011) 5-23. doi:

    • Crossref
    • Export Citation
  • [5] K. Wash Edgeless graphs are the only universal fixers Czechoslovak Math. J. 64 (2014) 833-843. doi:

    • Crossref
    • Export Citation
Journal information
Impact Factor
IMPACT FACTOR 2018: 0.741
5-year IMPACT FACTOR: 0.611

CiteScore 2018: 0.73

SCImago Journal Rank (SJR) 2018: 0.763
Source Normalized Impact per Paper (SNIP) 2018: 0.934

Mathematical Citation Quotient (MCQ) 2017: 0.36

Target audience:

researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 267 212 3
PDF Downloads 142 116 2