Nesrine Abbas ; Joseph Culberson ; Lorna Stewart - Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete

dmtcs:345 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, Vol. 7 - https://doi.org/10.46298/dmtcs.345
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete

Authors: Nesrine Abbas ; Joseph Culberson ; Lorna Stewart

    A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAX(U(k-SET)) and show that this problem is CO-NP-complete. This partially fills a gap in known complexity cases of maximal NP-complete problems, and raises some interesting open conjectures discussed in the conclusion.


    Volume: Vol. 7
    Published on: January 1, 2005
    Imported on: March 26, 2015
    Keywords: extremal,unfrozen,graph,independent set,co-NP-complete,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    Share

    Consultation statistics

    This page has been seen 212 times.
    This article's PDF has been downloaded 128 times.