RAIRO-Theor. Inf. Appl.
Volume 50, Number 2, April-June 2016
|Page(s)||135 - 144|
|Published online||20 September 2016|
The average lower reinforcement number of a graph
1 Department of Mathematics, Faculty of
Science, Karabük University, 78050, Karabük,
2 Turgutlu Vocational Training School, Celal Bayar University, 45400 Manisa, Turkey.
Accepted: 16 June 2016
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.
Mathematics Subject Classification: 05C40 / 05C69 / 68M10 / 68R10
Key words: Graph vulnerability / connectivity / network design and communication / domination number / reinforcement number / average lower reinforcement number
© EDP Sciences 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.