مرکز اطلاعات علمی 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:

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

Download:

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

Cites:

Information Journal Paper

Title

GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED

Pages

  53-60

Abstract

 A subset of the vertex set of a graph $G$ is called a Zero forcing set if by considering them colored and, as far as possible, a colored vertex with exactly one non-colored neighbor forces its non-colored neighbor to get colored, then the whole vertices of $G$ become colored. The Total forcing number of a graph $G$, denoted by $F_t(G)$, is the cardinality of a smallest Zero forcing set of $G$ which induces a subgraph with no isolated vertex. The Connected forcing number, denoted by $F_c(G)$, is the cardinality of a smallest Zero forcing set of $G$ which induces a connected subgraph. In this paper, we first characterize the graphs with $F_t(G)=2$ and, as a corollary, we characterize the graphs with $F_c(G)=2$.

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