On the average lower bondage number of graphs under join and corona operations

DOI10.1002/NUM.22675MaRDI QIDQ6064682zbMATH OpenOpenAlexWikidataFDO

Authors Tufan Turaci

Publication date 12 December 2023

Published in Numerical Methods for Partial Differential Equations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/num.22675

zbMATH Keywords

bondage numbercorona graphsdomination numberjoin graphsnetwork design and communicationvulnerability parameters

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the average lower bondage number of a graph
• Average lower domination number for some middle graphs
• The vulnerability of some networks including cycles via domination parameters
• The average lower independence number of total graphs
• The bondage number of some graphs

Cites work

• Average lower domination number of graphs
• Binding number and wheel related graphs
• Bounds on the bondage number of a graph
• Combining the concepts of residual and domination in graphs
• Design of survivable communications networks under performance constraints
• Domination alteration sets in graphs
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2192100 (Why is no real title available?)
• New results about the bondage number of a graph
• On combining the methods of link residual and domination in networks
• On the average lower bondage number of a graph
• On the bondage number of middle graphs
• Residual closeness and generalized closeness
• Robustness of regular caterpillars
• The average connectivity of a digraph
• The average lower connectivity of graphs
• The average lower reinforcement number 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 Measures of Transformation Graph G^xy+
• Vulnerability of complex networks
• Weak-rupture degree of graphs

This page was built for publication: On the average lower bondage number of graphs under join and corona operations

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