No label defined (Q4818795)

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 2104726
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2104726

      Statements

      0 references
      0 references
      0 references
      0 references
      1 October 2004
      0 references
      domination
      0 references
      irredundance
      0 references
      digraphs
      0 references
      tournaments
      0 references
      The irredundance number ir\((G)\), the domination number \(\gamma(G)\), the independent domination number \(i(G)\), the independence number \(\beta(G)\), the upper domination number \(\Gamma(G)\), and the upper irredundance number IR\((G)\), of a graph \(G\) are related by the well-known string of inequalities \[ \text{ir}(G) \leq \gamma(G) \leq i(G) \leq \beta(G) \leq \Gamma(G) \leq \text{IR}(G). \] The authors define similar notions for digraphs. They show that for digraphs the first and fifth of these inequalities hold but that the string of inequalities does not hold in general. For the remainder of the paper their results focus on domination and irredundance in tournaments. They conclude with numerous open problems.
      0 references

      Identifiers