Variants of the domination number for flower snarks

DOI10.26493/1855-3974.2710.F3DMaRDI QIDQ6597991

Ryan Burdett, Alex Newcombe, Michael Haythorpe

Publication date: 4 September 2024

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

zbMATH Keywords

independent domination numbertotal domination numbersecure domination number2-domination numberconnected domination numberweak Roman domination number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
• Computing the domination number of grid graphs
• An improved binary programming formulation for the secure domination problem
• On the domination number of generalized petersen graphs \(P(n,2)\)
• The exact domination number of the generalized Petersen graphs
• Total domination number of grid graphs
• Tightness of domination inequalities for direct product graphs
• The secure domination number of Cartesian products of small graphs with paths and cycles
• Domination in certain chemical graphs
• The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• The Domination Number of Grids
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• The domination numbers of the 5 × n and 6 × n grid graphs
• Total domination in cubic Knodel graphs
• Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
• Protection of graphs with emphasis on Cartesian product graphs
• On domination number of Latin square graphs of finite cyclic groups

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)