Ir al contenido

Documat


The zero forcing number of expanded paths and cycles

  • Yipeng Liao [1] ; Chaohui Chen [2] ; Jia Wei [1] ; Zoran Stanić [3]
    1. [1] South China Agricultural University

      South China Agricultural University

      China

    2. [2] Tongji University

      Tongji University

      China

    3. [3] University of Belgrade

      University of Belgrade

      Serbia

  • Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 69, Nº. 1, 2026, págs. 45-53
  • Idioma: inglés
  • DOI: 10.33044/revuma.5022
  • Enlaces
  • Referencias bibliográficas
    • AIM Minimum Rank – Special Graphs Work Group, Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl. 428 no. 7 (2008), 1628–1648....
    • J. A. Bondy and U. S. R. Murty, Graph theory, Graduate Texts in Mathematics 244, Springer, New York, 2008. MR Zbl
    • A. E. Brouwer and W. H. Haemers, Spectra of graphs, Universitext, Springer, New York, 2012. DOI MR Zbl
    • D. Burgarth, S. Bose, C. Bruder, and V. Giovannetti, Local controllability of quantum networks, Phys. Rev. A 79 no. 6 (2009), Paper No. 060305....
    • D. Burgarth, D. D'Alessandro, L. Hogben, S. Severini, and M. Young, Zero forcing, linear and quantum controllability for systems evolving...
    • D. Burgarth and V. Giovannetti, Full control by locally induced relaxation, Phys. Rev. Lett. 99 no. 10 (2007), Paper No. 100501. DOI
    • B. Cheng and B. Liu, On the nullity of graphs, Electron. J. Linear Algebra 16 (2007), 60–67. DOI MR Zbl
    • R. Davila and F. Kenter, Bounds for the zero forcing number of graphs with large girth, Theory Appl. Graphs 2 no. 2 (2015), Article 1. DOI...
    • S. English, C. MacRury, and P. Prałat, Probabilistic zero forcing on random graphs, European J. Combin. 91 (2021), Paper No. 103207. DOI...
    • Y.-Z. Fan and K.-S. Qian, On the nullity of bipartite graphs, Linear Algebra Appl. 430 no. 11-12 (2009), 2943–2949. DOI MR Zbl
    • M. Gentner, L. D. Penso, D. Rautenbach, and U. S. Souza, Extremal values and bounds for the zero forcing number, Discrete Appl. Math. 214...
    • T. Kalinowski, N. Kamčev, and B. Sudakov, The zero forcing number of graphs, SIAM J. Discrete Math. 33 no. 1 (2019), 95–115. DOI MR Zbl
    • Y.-P. Liang, J. Li, and S.-J. Xu, On extremal graphs for zero forcing number, Graphs Combin. 38 no. 6 (2022), Paper No. 185. DOI MR Zbl
    • D. D. Row, A technique for computing the zero forcing number of a graph with a cut-vertex, Linear Algebra Appl. 436 no. 12 (2012), 4423–4432....
    • D. Wong, Q. Zhou, and F. Tian, Nullity and singularity of a graph in which every block is a cycle, Discrete Math. 345 no. 6 (2022), Paper...
    • M. Zhao, L. Kang, and G. J. Chang, Power domination in graphs, Discrete Math. 306 no. 15 (2006), 1812–1816. DOI MR Zbl

Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno