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

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 the maximum diss...

Full description

Bibliographic Details

Published in:	AIMS mathematics Vol. 7; no. 1; pp. 569 - 578
Main Authors:	Tu, Jianhua, Zhang, Lei, Du, Junfeng, Lang, Rongling
Format:	Journal Article
Language:	English
Published:	AIMS Press 01.01.2022
Subjects:	independent set maximum dissociation set polynomial time algorithm tree
ISSN:	2473-6988, 2473-6988
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!