On the domination number of the cartesian product of the path graph and any pair of graphs

Documents similaires

• An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
  par: Troncoso, E. Acosta, et autres
  Publié: (2026)
• Independence numbers of some double vertex graphs and pair graphs
  par: Jiménez-Sepúlveda, Paloma, et autres
  Publié: (2018)
• Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
  par: Torres, Pablo
  Publié: (2025)
• Domination number of modular product graphs
  par: Bermudo, Sergio, et autres
  Publié: (2024)
• Independence numbers of the 2-token graphs of some join graphs
  par: Rivera, Luis Manuel, et autres
  Publié: (2025)