Abstract

The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered graph, that is, when all of its maximal independent sets have the same cardinality. For bipartite graphs $G$, we classify when $T_k(G)$ is well-covered. For an arbitrary graph $G$, we show that if $T_2(G)$ is well-covered, then the girth of $G$ is at most four. We include upper and lower bounds on the independence number of $T_k(G)$, and provide some families of well-covered token graphs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.