Deniz, Zakir2025-10-112025-10-1120242338-2287https://doi.org/10.5614/ejgta.2024.12.2.8https://hdl.handle.net/20.500.12684/21460A graph is well-covered if all of its maximal independent sets have the same size. A graph that remains well-covered upon the removal of any vertex is called a 1-well-covered graph. These graphs, when they have no isolated vertices, are also known as W-2 graphs. It is well-known that every graph G is an element of W-2 has two disjoint maximum independent sets. In this paper, we investigate connected W-2 graphs with n vertices that contain a clique of size n/3. We prove that if the removal of two disjoint maximum independent sets from a graph G is an element of W-2 leaves a clique of size at least 3, then G contains a clique of size n/3. Using this result, we provide a complete characterization of these graphs, based on eleven graph families.en10.5614/ejgta.2024.12.2.8info:eu-repo/semantics/openAccessindependent setcliquematchingwell-coveredArticle1222732882-s2.0-85212226717WOS:001354040100008Q3N/A