The average lower reinforcement number of a graph

DOI10.1051/ITA/2016015MaRDI QIDQ2953689zbMATH OpenOpenAlexFDO

Authors Ersin Aslan, Tufan Turaci

Publication date 5 January 2017

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2016015

zbMATH Keywords

average lower reinforcement numberconnectivitydomination numbergraph vulnerabilitynetwork design and communicationreinforcement number

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 975422
• Reinforcement numbers of digraphs
• The average lower connectivity of graphs
• On the average lower bondage number of a graph
• The average lower independence number of total graphs

Cites work

• A note on total reinforcement in graphs
• Average lower domination number of graphs
• Design of survivable communications networks under performance constraints
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 1185314 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2142620 (Why is no real title available?)
• scientific article; zbMATH DE number 2095763 (Why is no real title available?)
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• scientific article; zbMATH DE number 2192100 (Why is no real title available?)
• On average lower independence and domination numbers in graphs
• On domination and reinforcement numbers in trees
• On the \(p\)-reinforcement and the complexity
• On the average lower bondage number of a graph
• On the complexity of the bondage and reinforcement problems
• Reinforcement numbers of digraphs
• Roman reinforcement in graphs
• Signed reinforcement numbers of certain graphs
• The average connectivity of a digraph
• The average connectivity of a graph
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• Total reinforcement number of a graph
• Tough graphs and Hamiltonian circuits.
• Vertex vulnerability parameter of gear graphs
• Vulnerability of complex networks
• Vulnerability of Mycielski graphs via residual closeness.

Cited in

(4)

• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• On agglomeration-based rupture degree in networks and a heuristic algorithm
• On the average lower bondage number of graphs under join and corona operations
• On the bondage, strong and weak bondage numbers in complementary prism graphs

This page was built for publication: The average lower reinforcement number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953689)