video

sound

Persian Version

View:

10,323

Download:

10,962

Cites:

Information Journal Paper

Title

CONNECTED ZERO FORCING SETS AND CONNECTED PROPAGATION TIME OF GRAPHS

Pages

  77-88

Abstract

 The zero forcing number Z(G) of a graph G is the minimum cardinality of a set S with colored (black) vertices which forces the set V (G) to be colored (black) after some times. \color change rule": a white vertex is changed to a black vertex when it is the only white neighbor of a black vertex. In this case, we say that the black vertex forces the white vertex. We investigate here the concept of connected zero forcing set and connected zero forcing number. We discusses this subject for special graphs and some products of graphs. Also we introduce the connected propagation time. Graphs with extreme minimum connected propagation times and maximum propagation times |G| -1 and |G| -2 are characterized.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    KHOSRAVI, MARYAM, Rashidi, Saeedeh, & Sheikhhosseni, Alemeh. (2020). CONNECTED ZERO FORCING SETS AND CONNECTED PROPAGATION TIME OF GRAPHS. TRANSACTIONS ON COMBINATORICS, 9(2), 77-88. SID. https://sid.ir/paper/778062/en

    Vancouver: Copy

    KHOSRAVI MARYAM, Rashidi Saeedeh, Sheikhhosseni Alemeh. CONNECTED ZERO FORCING SETS AND CONNECTED PROPAGATION TIME OF GRAPHS. TRANSACTIONS ON COMBINATORICS[Internet]. 2020;9(2):77-88. Available from: https://sid.ir/paper/778062/en

    IEEE: Copy

    MARYAM KHOSRAVI, Saeedeh Rashidi, and Alemeh Sheikhhosseni, “CONNECTED ZERO FORCING SETS AND CONNECTED PROPAGATION TIME OF GRAPHS,” TRANSACTIONS ON COMBINATORICS, vol. 9, no. 2, pp. 77–88, 2020, [Online]. Available: https://sid.ir/paper/778062/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops