On the $Z_q$-forcing number: computational approach and exact values

Documenti analoghi

• The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
  di: Abiad, Aida, et al.
  Pubblicazione: (2024)
• On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
  di: Abiad, Aida, et al.
  Pubblicazione: (2023)
• Propagation processes on (hyper)graphs: where zero forcing and burning meet
  di: Abiad, Aida, et al.
  Pubblicazione: (2026)
• Unified bounds for the independence number of graph powers
  di: Abiad, Aida, et al.
  Pubblicazione: (2024)
• Eigenvalue bounds for the quantum chromatic number of graph powers
  di: Abiad, Aida, et al.
  Pubblicazione: (2025)