On the average lower bondage number of graphs under join and corona operations
DOI10.1002/num.22675OpenAlexW3107337983WikidataQ115397565 ScholiaQ115397565MaRDI QIDQ6064682
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
domination numberbondage numberjoin graphsnetwork design and communicationcorona graphsvulnerability parameters
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- On the bondage number of middle 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 lower connectivity of graphs
- The average connectivity of a digraph
- Tough graphs and Hamiltonian circuits.
- The average lower reinforcement number of a graph
- On the average lower bondage number of a graph
- Binding Number and Wheel Related Graphs
- VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
- RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
- Design of survivable communications networks under performance constraints
- Vulnerability Measures of Transformation Graph Gxy+
- Robustness of Regular Caterpillars
- On Combining the Methods of Link Residual and Domination in Networks
- Combining the Concepts of Residual and Domination in Graphs
- Weak-Rupture Degree of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the average lower bondage number of graphs under join and corona operations