The average lower reinforcement number of a graph
| dc.contributor.author | Turaci T. | |
| dc.contributor.author | Aslan E. | |
| dc.date.accessioned | 2025-04-10T11:09:33Z | |
| dc.date.available | 2025-04-10T11:09:33Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | 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. | |
| dc.identifier.DOI-ID | 10.1051/ita/2016015 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/48797 | |
| dc.publisher | EDP Sciences | |
| dc.title | The average lower reinforcement number of a graph | |
| dc.type | Article |