No label defined (Q4378639)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1124610
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1124610

      Statements

      0 references
      0 references
      0 references
      0 references
      31 August 1998
      0 references
      domination
      0 references
      bondage number
      0 references
      reinforcement number
      0 references
      insensitivity
      0 references
      The bondage number \(b(G)\) of a graph \(G\) is the smallest number of edges whose removal from \(G\) increases the domination number of \(G\) (e.g. \(b(C_4) = 3\)). This paper gives a survey of results on the bondage number and several generalizations, the fractional bondage number, the reinforcement number, and \((\gamma, k)\)-insensitive graphs. For the entire collection see [Zbl 0883.00011].
      0 references

      Identifiers