Variants of the domination number for flower snarks
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.
- A note on the domination number of the Cartesian products of paths and cycles
- An improved binary programming formulation for the secure domination problem
- Computing the domination number of grid graphs
- Domination in certain chemical graphs
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- scientific article; zbMATH DE number 3902703 (Why is no real title available?)
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 2109312 (Why is no real title available?)
- scientific article; zbMATH DE number 861434 (Why is no real title available?)
- scientific article; zbMATH DE number 3236819 (Why is no real title available?)
- scientific article; zbMATH DE number 2234856 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On domination number of Latin square graphs of finite cyclic groups
- On the domination number of 2-dimensional torus graphs
- On the domination number of generalized petersen graphs \(P(n,2)\)
- On the domination number of Knödel graph \(W_{3,n}\)
- Protection of graphs with emphasis on Cartesian product graphs
- Secure domination in middle graphs
- Solving the connected dominating set problem and power dominating set problem by integer programming
- The domination number of grids
- The domination numbers of the 5 × n and 6 × n grid graphs
- The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
- The exact domination number of the generalized Petersen graphs
- The secure domination number of Cartesian products of small graphs with paths and cycles
- Tightness of domination inequalities for direct product graphs
- Total and connected domination in chemical graphs
- Total domination in cubic Knodel graphs
- Total domination number of grid graphs
- Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
This page was built for publication: Variants of the domination number for flower snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597991)