Counting Dominating Sets in Directed Path Graphs

07/01/2022
by   Min-Sheng Lin, et al.
0

A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its subclass of interval graphs. The complexity status of the corresponding problem is still undetermined for directed path graphs, which are a well-known class of graphs that falls between chordal graphs and interval graphs. This paper reveals that the problem of counting dominating sets remains #P-complete for directed path graphs but a stricter constraint to rooted directed path graphs admits a polynomial-time solution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2023

On the complexity of Dominating Set for graphs with fixed diameter

A set S⊆ V of a graph G=(V,E) is a dominating set if each vertex has a n...
research
08/15/2018

Counting Minimal Transversals of β-Acyclic Hypergraphs

We prove that one can count in polynomial time the number of minimal tra...
research
03/10/2021

Effectively Counting s-t Simple Paths in Directed Graphs

An important tool in analyzing complex social and information networks i...
research
12/03/2017

Digraph Polynomials for Counting Cycles and Paths

Many polynomial invariants are defined on graphs for encoding the combin...
research
02/13/2019

New Results on Directed Edge Dominating Set

We study a family of generalizations of Edge Dominating Set on directed ...
research
10/12/2017

On the Containment Problem for Linear Sets

It is well known that the containment problem (as well as the equivalenc...
research
12/06/2019

Dominating sets reconfiguration under token sliding

Let G be a graph and D_s and D_t be two dominating sets of G of size k. ...

Please sign up or login with your details

Forgot password? Click here to reset