THE AVERAGE LOWER REINFORCEMENT NUMBER OF A GRAPH
| dc.contributor.author | Turaci, T | |
| dc.contributor.author | Aslan, E | |
| dc.date.accessioned | 2025-04-10T10:29:57Z | |
| dc.date.available | 2025-04-10T10:29:57Z | |
| 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 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). 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. | |
| dc.identifier.e-issn | 1290-385X | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/36613 | |
| dc.language.iso | English | |
| dc.title | THE AVERAGE LOWER REINFORCEMENT NUMBER OF A GRAPH | |
| dc.type | Article |