مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

9
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Dynamic monopolies in simple graphs

Pages

  151-162

Abstract

 This paper studies a repetitive polling game played on an n-vertex graph G. At first, each vertex is colored, Black or White. At each round, each vertex (simultaneously) recolors itself by the color of the majority of its closed neighborhood. The variants of the model differ in the choice of a particular tiebreaking rule. We assume the tie-breaking rule is Prefer-White and we study the relation between the notion of “dynamic monopoly” and “vertex cover” of G. In particular, we show that any vertex cover of G is a dynamic monopoly or reaches a 2−periodic coloring. Moreover, we compute dyn(G) for some special classes of graphs including paths, cycles and links of some graphs.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

  • No record.

    • Cite

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button