Variants of the domination number for flower snarks (Q6597991)

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 7906399
Language Label Description Also known as
default for all languages
No label defined
    English
    Variants of the domination number for flower snarks
    scientific article; zbMATH DE number 7906399

      Statements

      Variants of the domination number for flower snarks (English)
      0 references
      0 references
      0 references
      0 references
      4 September 2024
      0 references
      This paper investigates variants of the domination number for the infinite family of flower snarks \( J_n \), a well-known class of cubic graphs. Flower snarks are of particular interest due to their 3-regularity and non-3-edge-colorability. The authors extend the current understanding by determining several domination-related parameters for \( J_n \), including the independent domination number, 2-domination number, total domination number, connected domination number, secure domination number, and weak Roman domination number. A key contribution is the derivation of exact formulas and bounds for these domination parameters as functions of \( n \), accompanied by rigorous proofs, often utilizing induction and configurations. The study is relevant for researchers interested in graph theory, specifically those working on domination, snarks, or 3-regular graphs.
      0 references
      independent domination number
      0 references
      2-domination number
      0 references
      total domination number
      0 references
      connected domination number
      0 references
      secure domination number
      0 references
      weak Roman domination number
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers