The average lower reinforcement number of a graph

Simple item page
dc.contributor.authorTuraci T.
dc.contributor.authorAslan E.
dc.date.accessioned2024-07-22T08:12:17Z
dc.date.available2024-07-22T08:12:17Z
dc.date.issued2016
dc.description.abstractLet 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-ID10.1051/ita/2016015
dc.identifier.issn28047346
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/15974
dc.language.isoEnglish
dc.publisherEDP Sciences
dc.rightsAll Open Access; Green Open Access
dc.subjectNetwork security
dc.subjectAverage lower reinforcement number
dc.subjectConnectivity
dc.subjectDomination number
dc.subjectGraph vulnerability
dc.subjectNetwork design
dc.subjectReinforcement
dc.titleThe average lower reinforcement number of a graph
dc.typeArticle

Files

Collections

Scopus Koleksiyonu