Zero forcing in Benzenoid network

• Anitha, J. ; Rajasingh, Indra ^[1]
  1. [1] Vellore Institute of Technology University

     Vellore Institute of Technology University

     India

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 38, Nº. 5, 2019, págs. 999-1010
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-2019-05-0064
• Enlaces
  • Texto completo
• Resumen

  • A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of rules for power system monitoring. The power domination number of G is the minimum cardinality of a power dominating set of G. A dynamic coloring of the vertices of a graph G starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set S is called a forcing set (zero forcing set) of G if, by iteratively applying the forcing process, every vertex in G becomes colored. The zero forcing number of G, denoted Z(G), is the minimum cardinality of a zero forcing set of G. In this paper, we obtain the zero forcing number for certain benzenoid networks.

     

• Referencias bibliográficas
  • AIM Minimum Rank – Special Graphs Work Group, “Zero forcing sets and the minimum rank of graphs”, Linear algebra and its applications, vol....
  • D. Burgarth, V. Giovannetti, L. Hogben, S. Severini and M. Young, “Logic circuits from zero forcing”, Natural computing, vol. 14, no. 3, pp....
  • M. Gentner, L. Penso, D. Rautenbach and U. Souza, “Extremal values and bounds for the zero forcing number”, Discrete applied aathematics,...
  • T. Haynes, S. Hedetniemi, S. Hedetniemi, and M. Henning, “Power domination in graphs applied to electrical power networks”. SIAM journal on...
  • K. Benson, D. Ferrero, M. Flagg, V. Furst, L. Hogben, V. Vasilevska and B. Wissman, “Zero forcing and power domination for product graphs”,...
  • J. Anitha and I. Rajasingh “Power domination parameters in honeycomb-like networks,” in Applied mathematics and scientific computing. Trends...
  • J. Quadras, K. Balasubramanian and K. Arputha Christy, “Analytical expressions for Wiener indices of n-circumscribed pericondensed benzenoid...