THE AVERAGE LOWER REINFORCEMENT NUMBER OF A GRAPH
| dc.authorid | TURACI, TUFAN/0000-0002-6159-0935 | |
| dc.contributor.author | Turaci, Tufan | |
| dc.contributor.author | Aslan, Ersin | |
| dc.date.accessioned | 2024-09-29T16:01:08Z | |
| dc.date.available | 2024-09-29T16:01:08Z | |
| dc.date.issued | 2016 | |
| dc.department | Karabük Üniversitesi | en_US |
| 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. | en_US |
| dc.identifier.doi | 10.1051/ita/2016015 | |
| dc.identifier.endpage | 144 | en_US |
| dc.identifier.issn | 1290-385X | |
| dc.identifier.issue | 2 | en_US |
| dc.identifier.scopus | 2-s2.0-84989184539 | en_US |
| dc.identifier.scopusquality | Q2 | en_US |
| dc.identifier.startpage | 135 | en_US |
| dc.identifier.uri | https://doi.org/10.1051/ita/2016015 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/5529 | |
| dc.identifier.volume | 50 | en_US |
| dc.identifier.wos | WOS:000388460000002 | en_US |
| dc.identifier.wosquality | Q4 | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Edp Sciences S A | en_US |
| dc.relation.ispartof | Rairo-Theoretical Informatics and Applications | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Graph vulnerability | en_US |
| dc.subject | connectivity | en_US |
| dc.subject | network design and communication | en_US |
| dc.subject | domination number | en_US |
| dc.subject | reinforcement number | en_US |
| dc.subject | average lower reinforcement number | en_US |
| dc.title | THE AVERAGE LOWER REINFORCEMENT NUMBER OF A GRAPH | en_US |
| dc.type | Article | en_US |
