On the average lower bondage number of a graph

DOI10.1051/ro/2015062zbMath1353.05095OpenAlexW2528215271MaRDI QIDQ2954366

Tufan Turaci

Publication date: 12 January 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015062

zbMATH Keywords

connectivitydomination numberbondage numbernetwork design and communicationgraph vulnerabilityaverage lower bondage number

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (8)

On the bondage, strong and weak bondage numbers in complementary prism graphs ⋮ The vulnerability of some networks including cycles via domination parameters ⋮ On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ The average lower reinforcement number of a graph ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ Exponential Independence Number of Some Graphs ⋮ Roman \(\{2\}\)-bondage number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the bondage number of middle graphs
• On average lower independence and domination numbers in graphs
• Domination alteration sets in graphs
• Vulnerability of complex networks
• The bondage number of a graph
• Bounds on the bondage number of a graph
• New results about the bondage number of a graph
• The average connectivity of a graph
• The average connectivity of a digraph
• Tough graphs and Hamiltonian circuits.
• VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
• Design of survivable communications networks under performance constraints

This page was built for publication: On the average lower bondage number of a graph