Steiner Tree in k-star Caterpillar Convex Bipartite Graphs – A Dichotomy

07/20/2021
by   Aneesh D H, et al.
0

The class of k-star caterpillar convex bipartite graphs generalizes the class of convex bipartite graphs. For a bipartite graph with partitions X and Y, we associate a k-star caterpillar on X such that for each vertex in Y, its neighborhood induces a tree. The k-star caterpillar on X is imaginary and if the imaginary structure is a path (0-star caterpillar), then it is the class of convex bipartite graphs. The minimum Steiner tree problem (STREE) is defined as follows: given a connected graph G=(V,E) and a subset of vertices R ⊆ V(G), the objective is to find a minimum cardinality set S ⊆ V(G) such that the set R ∪ S induces a connected subgraph. STREE is known to be NP-complete on general graphs as well as for special graph classes such as chordal graphs, bipartite graphs, and chordal bipartite graphs. The complexity of STREE in convex bipartite graphs, which is a popular subclass of chordal bipartite graphs, is open. In this paper, we introduce k-star caterpillar convex bipartite graphs, and show that STREE is NP-complete for 1-star caterpillar convex bipartite graphs and polynomial-time solvable for 0-star caterpillar convex bipartite graphs (also known as convex bipartite graphs). In <cit.>, it is shown that STREE in chordal bipartite graphs is NP-complete. A close look at the reduction instances reveal that the instances are 3-star caterpillar convex bipartite graphs, and in this paper, we strengthen the result of <cit.>.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/17/2021

Roman Domination in Convex Bipartite Graphs

In the Roman domination problem, an undirected simple graph G(V,E) is gi...
research
01/15/2019

On Extremal Graphs of Weighted Szeged Index

An extension of the well-known Szeged index was introduced recently, nam...
research
04/16/2018

Hardness and structural results for half-squares of restricted tree convex bipartite graphs

Let B=(X,Y,E) be a bipartite graph. A half-square of B has one color cla...
research
08/06/2021

Complexity of Restricted Star Colouring

Restricted star colouring is a variant of star colouring introduced to d...
research
03/20/2022

Red Domination in Perfect Elimination Bipartite Graphs

The k red domination problem for a bipartite graph G=(X,Y,E) is to find ...
research
07/10/2021

Hamiltonicity: Variants and Generalization in P_5-free Chordal Bipartite graphs

A bipartite graph is chordal bipartite if every cycle of length at least...
research
11/21/2017

On P_5-free Chordal bipartite graphs

A bipartite graph is chordal bipartite if every cycle of length at least...

Please sign up or login with your details

Forgot password? Click here to reset