Publication:4378639
From MaRDI portal
zbMath0894.05025MaRDI QIDQ4378639
Lutz Volkmann, Ulrich Teschner, Teresa W. Haynes, Jean E. Dunbar
Publication date: 31 August 1998
Related Items
Upper bounds on the bondage number of the strong product of a graph and a tree, On the double Roman bondage numbers of 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, NP-hardness of multiple bondage in 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, 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
