Browsing by Author "Turaci T."

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    The average lower reinforcement number of a graph
    (EDP Sciences, 2016) Turaci T.; Aslan E.
    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 re∗(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 rav (G)=1/E(G) ∑e∗∈E(G) re∗(G). In this paper, we define the average lower reinforcement number of a graph and we present the exact values for some well-known graph families. © EDP Sciences 2016.