scientific article; zbMATH DE number 1124610
From MaRDI portal
Publication:4378639
Recommendations
Cited in
(30)- Reinforcement numbers of digraphs
- On bondage numbers of graphs: a survey with some comments
- Some progress on total bondage in graphs
- On the \(p\)-reinforcement and the complexity
- On the complexity of multiple bondage in graphs
- Total restrained bondage in graphs
- Bondage number of the strong product of two trees
- The bondage numbers and efficient dominations of vertex-transitive graphs
- The bondage numbers of extended de Bruijn and Kautz digraphs
- On the bondage number of planar and directed graphs
- Bondage number of the discrete torus \(C_n\times C_4\)
- The bondage number of the strong product of a complete graph with a path and a special starlike tree
- Roman domination in graphs
- On the complexity of reinforcement in graphs
- Upper bounds for the bondage number of graphs on topological surfaces
- The k-rainbow bondage number of a graph
- An improved upper bound for the bondage number of graphs on surfaces
- Upper bounds on the bondage number of the strong product of a graph and a tree
- scientific article; zbMATH DE number 2142620 (Why is no real title available?)
- scientific article; zbMATH DE number 2095763 (Why is no real title available?)
- NP-hardness of multiple bondage in graphs
- On the double Roman bondage numbers of graphs
- A note on total reinforcement in graphs
- The \(p\)-bondage number of trees
- On the Roman bondage number of planar graphs
- Bondage number of mesh networks
- The total bondage number of grid graphs
- Bondage numbers of Mycielski graphs
- The bondage numbers of graphs with small crossing numbers
- Bondage number of strong product of two paths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378639)
