I call the problem as DOM. Given a graph $G$ and an integer $d$, Decision problem DOM - "Does there exists a dominating set of size less than or equal to 'd' in G? " DOM is NP Complete problem. But, if we specify some class of graphs $G'$ and if we ask the same question, then DOM might be solved in polynomial time. (Eg : Given $C_n$, and an integer $d$ , you can verify DOM in polynomial time ) Till date , for which all classes of graphs, DOM problem can be solved in polynomial time ? [Let me know where I can find research papers worked on this topic]
2026-03-25 10:59:40.1774436380
Domination problem is NPC
67 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in REFERENCE-REQUEST
- Best book to study Lie group theory
- Alternative definition for characteristic foliation of a surface
- Transition from theory of PDEs to applied analysis and industrial problems and models with PDEs
- Random variables in integrals, how to analyze?
- Abstract Algebra Preparation
- Definition of matrix valued smooth function
- CLT for Martingales
- Almost locality of cubic spline interpolation
- Identify sequences from OEIS or the literature, or find examples of odd integers $n\geq 1$ satisfying these equations related to odd perfect numbers
- property of Lebesgue measure involving small intervals
Related Questions in ALGORITHMS
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Do these special substring sets form a matroid?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Correct way to prove Big O statement
- Product of sums of all subsets mod $k$?
- (logn)^(logn) = n^(log10+logn). WHY?
- Clarificaiton on barycentric coordinates
- Minimum number of moves to make all elements of the sequence zero.
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
- sources about SVD complexity
Related Questions in NP-COMPLETE
- Divide set into two subsets of equal sum and maximum this sum
- Linear Programming Primal-Dual tough question
- Bipartite Graph Partitioning (special case)
- Minimise the sum of pairwise distances between labelled points in a metric space subject to covering some set of labels
- How should a chain of proof be written?
- Show the NP completeness of Hamiltonian Path with the knowledge of an directed Euler graph
- Integer Programming (non $0-1$) Reduction to show $NP$ Completeness
- Categories with at most one arrow between any pair of objects. (appears in NPC)
- Find a generalized path cover of a square graph
- Generalize minimum path cover
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I guess that related Wikipedia article is a rather complete and up to date source. According to it, a minimum dominating set can be found in linear time in series-parallel graphs. On the other hand, even for planar graphs the problem remains NP-hard, but it admits a polynomial-time approximation scheme (PTAS) and a fixed-parameter algorithm is known.