Abstract
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices, while the weight of a set of vertices is the sum of their weights. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G, the set of weight functions w such that G is w-well-covered is a vector space, denoted WCW(G). In what follows, all weights are real. Let B be a complete bipartite induced subgraph of G on vertex sets of bipartition \(B_{X}\) and \(B_{Y}\). Then B is generating if there exists an independent set S such that \(S \cup B_{X}\) and \(S \cup B_{Y}\) are both maximal independent sets of G. Generating subgraphs play an important role in finding WCW(G). In the restricted case that a generating subgraph B is isomorphic to \(K_{1,1}\), its unique edge is called a relating edge. Deciding whether an input graph G is well-covered is co-NP-complete. Therefore finding WCW(G) is co-NP-hard. Deciding whether an edge is relating is NP-complete. Therefore, deciding whether a subgraph is generating is NP-complete as well. This article deals with graphs G such that \(\Delta (G)=|V(G)|-k\) for some \(k\in \mathbb {N}\). We prove that for this family recognizing well-covered graphs is a polynomial problem, while finding WCW(G) is co-NP-hard. To the best of our knowledge, this is the first family of graphs in the literature known to have these properties. For this set of graphs, recognizing relating edges and generating subgraphs is NP-complete. The article also deals with connected graphs for which \(\delta (G) = k\) or \(\delta (G) \ge \frac{k-1}{k}|V(G)|\). For these families of graphs recognizing well-covered graphs is co-NP-complete, while recognizing relating edges is NP-complete.
Similar content being viewed by others
References
Brown, J.I., Nowakowski, R.J.: Well covered vector spaces of graphs. SIAM J. Discret. Math. 19, 952–965 (2006)
Brown, J.I., Nowakowski, R.J., Zverovich, I.E.: The structure of well-covered graphs with no cycles of length 4. Discret. Math. 307, 2235–2245 (2007)
Caro, Y., Ellingham, N., Ramey, G.F.: Local structure when all maximal independent sets have equal weight. SIAM J. Discret. Math. 11, 644–654 (1998)
Caro, Y., Sebő, A., Tarsi, M.: Recognizing greedy structures. J. Algorithm 20, 137–156 (1996)
Chvatal, V., Slater, P.J.: A note on well-covered graphs, Quo Vadis, Graph Theory?, Ann. Discret. Math. North Holland, Amsterdam 55, 179–182 (1993)
Finbow, A., Hartnell, B., Nowakowski, R.: A characterization of well-covered graphs of girth 5 or greater. J. Comb. Theory B 57, 44–68 (1993)
Finbow, A., Hartnell, B., Nowakowski, R.: A characterization of well-covered graphs that contain neither 4- nor 5-cycles. J. Graph. Theory 18, 713–721 (1994)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1990)
Levit, V.E., Tankus, D.: Weighted well-covered graphs without \(C_{4}\), \(C_{5}\), \(C_{6}\), \(C_{7}\). Discret. Appl. Math. 159, 354–359 (2011)
Levit, V.E., Tankus, D.: On relating edges in graphs without cycles of length 4. J. Discret. Algorithms 26, 28–33 (2014)
Levit, V.E., Tankus, D.: Weighted well-covered claw-free graphs. Discret. Math. 338, 99–106 (2015)
Levit, V.E., Tankus, D.: Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. 186, 158–167 (2015)
Levit, V.E., Tankus, D.: Complexity results for generating graphs. Algorithmica 80, 2384–2399 (2018)
Levit, V.E., Tankus, D.: Generating subgraphs in chordal graphs, (2018) https://arxiv.org/pdf/1811.04429.pdf
Levit, V.E., Tankus, D.: Recognizing generating subgraphs revisited. Int. J. Found. Comput. Sci. 32, 93–114 (2021)
Plummer, M.D.: Some covering concepts in graphs. J. Comb. Theory 8, 91–98 (1970)
Ravindra, G.: Well-covered graphs. J. Comb. Info. Syst. Sci. 2, 20–21 (1977)
Sankaranarayana, R.S., Stewart, L.K.: Complexity results for well-covered graphs. Netw. 22, 247–262 (1992)
Tankus, D.: Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7. Discret. Appl. Math. 283, 189–198 (2020)
Tankus, D., Tarsi, M.: Well-covered claw-free graphs. J. Comb. Theory B 66, 293–302 (1996)
Tankus, D., Tarsi, M.: The structure of well-covered graphs and the complexity of their recognition problems. J. Comb. Theory B 69, 230–233 (1997)
Topp, J., Volkmann, L.: On the well-coveredness of products of graphs. Ars Comb. 33, 199–215 (1992)
Acknowledgements
We thank both reviewers for their careful reading and very thoughtful and comprehensive comments. Their remarks helped us improve the definition of the \(\textbf{WCW}\) problem, and formulate Lemma 2.3 using vector spaces. Our special thanks to the second reviewer for a very detailed report. For instance, the report advised us to use the notion of lexicographic product, and improved the proof of Theorem 4.6.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Levit, V.E., Tankus, D. Well-Covered Graphs With Constraints On \(\Delta \) And \(\delta \). Theory Comput Syst 67, 1197–1208 (2023). https://doi.org/10.1007/s00224-023-10140-0
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-023-10140-0