On the average lower bondage number of a graph

DOI10.1051/RO/2015062MaRDI QIDQ2954366zbMATHOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 1484052 (Why is no real title available?)
• scientific article; zbMATH DE number 2192100 (Why is no real title available?)
• Average lower domination number of graphs
• Bounds on the bondage number of a graph
• Design of survivable communications networks under performance constraints
• Domination alteration sets in graphs
• New results about the bondage number of a graph
• On average lower independence and domination numbers in graphs
• On the bondage number of middle graphs
• The average connectivity of a digraph
• The average connectivity of a graph
• The bondage number of a graph
• The bondage number of some graphs
• Tough graphs and Hamiltonian circuits.
• Vertex vulnerability parameter of gear graphs
• Vulnerability of complex networks

Cited in

(14)

• The vulnerability of some networks including cycles via domination parameters
• Roman \(\{2\}\)-bondage number of a graph
• On the average lower bondage number of graphs under join and corona operations
• The average lower reinforcement number of a graph
• Average lower domination number for some middle graphs
• Exponential independence number of some graphs
• On the bondage, strong and weak bondage numbers in complementary prism graphs
• On the average crosscap number. II: Bounds for a graph
• Combining the concepts of residual and domination in graphs
• scientific article; zbMATH DE number 5778835 (Why is no real title available?)
• Lower bound of the Hadwiger number of graphs by their average degree
• Average lower domination number of graphs
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• On agglomeration-based rupture degree in networks and a heuristic algorithm

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)