scientific article; zbMATH DE number 1124610
From MaRDI portal
Publication:4378639
zbMath0894.05025MaRDI QIDQ4378639
Lutz Volkmann, Ulrich Teschner, Teresa W. Haynes, Jean E. Dunbar
Publication date: 31 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Total restrained bondage in graphs ⋮ On the complexity of reinforcement in graphs ⋮ Bondage number of the strong product of two trees ⋮ The bondage numbers of graphs with small crossing numbers ⋮ Upper bounds for the bondage number of graphs on topological surfaces ⋮ The \(k\)-rainbow bondage number of a graph ⋮ Bondage number of strong product of two paths ⋮ On the double Roman bondage numbers of graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ A note on total reinforcement in graphs ⋮ An improved upper bound for the bondage number of graphs on surfaces ⋮ The \(p\)-bondage number of trees ⋮ On the Roman bondage number of planar graphs ⋮ NP-hardness of multiple bondage in graphs ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ The bondage numbers and efficient dominations of vertex-transitive graphs ⋮ The bondage numbers of extended de Bruijn and Kautz digraphs ⋮ On the \(p\)-reinforcement and the complexity ⋮ Bondage number of mesh networks ⋮ Some progress on total bondage in graphs ⋮ On the bondage number of planar and directed graphs ⋮ The total bondage number of grid graphs ⋮ Bondage numbers of Mycielski graphs ⋮ The bondage number of the strong product of a complete graph with a path and a special starlike tree ⋮ Roman Domination in Graphs ⋮ Reinforcement numbers of digraphs ⋮ On the complexity of multiple bondage in graphs ⋮ Bondage number of the discrete torus \(C_n\times C_4\)
This page was built for publication:
