scientific article; zbMATH DE number 68339
From MaRDI portal
Publication:4014294
zbMATH Open0767.05078MaRDI QIDQ4014294FDOQ4014294
Authors: Douglas F. Rall, Bert L. Hartnell 
Publication date: 6 October 1992
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Cited In (21)
- Extremal graphs domination insensitive to the removal of \(k\) edges
- Non-isolating 2-bondage in graphs
- The \(p\)-bondage number of trees
- An extremal problem for edge domination insensitive graphs
- On the bondage number of a graph
- On construction for trees making the equality hold in Vizing's conjecture
- Bondage numbers of Mycielski graphs
- Edge criticality in graph domination
- Upper bounds on the bondage number of the strong product of a graph and a tree
- The \(k\)-power bondage number of a graph
- A characterization of trees based on edge-deletion and its applications for domination-type invariants
- Bounds on the bondage number of a graph
- New results about the bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- Bondage number of mesh networks
- Changing and unchanging domination: A classification
- The total bondage number of grid graphs
- A bound on the size of a graph with given order and bondage number
- Non-isolating bondage in graphs
- Paired bondage in trees
- Bondage number of the discrete torus \(C_n\times C_4\)
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 Q4014294)
