On the average lower bondage number of a graph

DOI10.1051/RO/2015062zbMATH Open1353.05095OpenAlexW2528215271MaRDI QIDQ2954366FDOQ2954366

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

Recommendations

• scientific article; zbMATH DE number 7033851
• Average edge-domination number in graphs
• Average lower domination number for some middle graphs
• The average lower connectivity of graphs
• The vulnerability of some networks including cycles via domination parameters

zbMATH Keywords

domination numberconnectivitybondage numbernetwork design and communicationgraph vulnerabilityaverage lower bondage number

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• On the bondage, strong and weak bondage numbers in complementary prism graphs
• On the average crosscap number. II: Bounds for a graph
• Exponential Independence Number of Some Graphs
• Title not available (Why is that?)
• Lower bound of the Hadwiger number of graphs by their average degree
• 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
• The vulnerability of some networks including cycles via domination parameters
• Roman \(\{2\}\)-bondage number of a graph
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

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

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