THE AVERAGE LOWER REINFORCEMENT NUMBER OF A GRAPH


TURACI T. , ASLAN E.

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, cilt.50, ss.135-144, 2016 (SCI İndekslerine Giren Dergi)

  • Cilt numarası: 50 Konu: 2
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1051/ita/2016015
  • Dergi Adı: RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS
  • Sayfa Sayısı: ss.135-144

Özet

Let G = (V (G), E(G)) be a simple undirected graph. The reinforcement number of a graph is a vulnerability parameter of a graph. We have investigated a refinement that involves the average lower reinforcement number of this parameter. The lower reinforcement number, denoted by r(e*) (G), is the minimum cardinality of reinforcement set in G that contains the edge e* of the complement graph G. The average lower reinforcement number of G is defined by r(av)(G) = 1/ |E(G)| Sigma(e*)is an element of E((G) over bar) r(e*) (G).