Finding Efficient Domination for S_1,3,3-Free Bipartite Graphs in Polynomial Time

08/10/2020 ∙ by Andreas Brandstädt, et al. ∙ 0

A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is -complete for various H-free bipartite graphs, e.g., Lu and Tang showed that ED is -complete for chordal bipartite graphs and for planar bipartite graphs; actually, ED is -complete even for planar bipartite graphs with vertex degree at most 3 and girth at least g for every fixed g. Thus, ED is -complete for K_1,4-free bipartite graphs and for C_4-free bipartite graphs. In this paper, we show that ED can be solved in polynomial time for S_1,3,3-free bipartite graphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.