Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree

TL;DR

This paper presents a linear time algorithm to identify vertices in trees that are contained in all or no maximum dissociation sets, addressing a specific NP-hard problem in graph theory.

Contribution

It introduces a polynomial time recognition algorithm for vertices in all or no maximum dissociation sets of a tree, a problem previously known to be NP-hard.

Findings

Linear time recognition algorithm for vertices in all maximum dissociation sets

Algorithm determines vertices in no maximum dissociation sets

Applicable to trees with n vertices in O(n^2) time

Abstract

In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-hard even for bipartite graphs and is called the maximum dissociation set problem. The complexity of maximum dissociation set problem in various subclasses of graphs has been extensively studied in the literature. In this paper, we study the maximum dissociation problem from different perspectives and characterize the vertices belonging to all maximum dissociation sets, and to no maximum dissociation set of a tree. We present a linear time recognition algorithm which can determine whether a given vertex in a tree is contained in all (or no) maximum dissociation sets of the tree. Thus for a tree with n vertices, we can find all vertices belonging to all (or no) maximum dissociation sets of the tree in O(n^2) time.