Corpus ID: 35421753

On Independent and ( d , n )-domination numbers of hypercubes

@inproceedings{Mane2012OnIA,
  title={On Independent and ( d , n )-domination numbers of hypercubes},
  author={S. Mane and B. Waphare},
  year={2012}
}
  • S. Mane, B. Waphare
  • Published 2012
  • In this paper we consider the (d, n)-domination number, γd,n(Qn), the distance-d domination number γd(Qn) and the connected distance-d domination number γc,d(Qn) of ndimensional hypercube graphs Qn. We show that for 2 ≤ d ≤ bn/2c, and n ≥ 4, γd,n(Qn) ≤ 2n−2d+2, improving the bound of Xie and Xu [19]. We also show that γd(Qn) ≤ 2n−2d+2−r, for 2 − 1 ≤ n − 2d + 1 < 2 − 1, and γc,d(Qn) ≤ 2n−d, for 1 ≤ n− d + 1 ≤ 3, and γc,d(Qn) ≤ 2n−d−1 + 4, for n− d + 1 ≥ 4. Moreover, we give an upper bound of the… CONTINUE READING
    The domination number of exchanged hypercubes
    • 21
    • PDF
    Spanning Trees and Domination in Hypercubes.
    • 1
    • PDF
    Genetic Approach To Hypercube Problems
    • 1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES
    Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
    • 117
    • PDF
    Regular connected bipancyclic spanning subgraphs of hypercubes
    • 13
    Independent perfect domination sets in Cayley graphs
    • 36
    Improved sphere bounds on the coveting radius of codes
    • 88
    • Highly Influential
    Introduction to Graph Theory
    • 5,373
    • PDF
    From error-correcting codes through sphere packings to simple groups
    • 139
    • PDF
    Another characterization of hypercubes
    • 24
    • PDF
    Independent domination in hypercubes
    • 24
    • PDF
    Algebraic coding theory
    • 2,686
    Error detecting and error correcting codes
    • 4,770
    • PDF