Independence numbers of the 2-token graphs of some join graphs

TL;DR

This paper investigates the independence numbers of 2-token graphs derived from join graphs, providing a construction method and calculating these numbers for specific graph families like fan, wheel, and join of an empty graph with a complete graph.

Contribution

It introduces a method to construct large independent sets in 2-token graphs of join graphs and computes their independence numbers for several important graph classes.

Findings

Provides a construction method for independent sets in 2-token graphs of join graphs.

Determines the independence number for 2-token graphs of fan, wheel, and join of empty and complete graphs.

Abstract

The $2$-token graph $F_2(G)$ of a graph $G$ is the graph whose set of vertices consists of all the $2$-subsets of $V(G)$, where two vertices are adjacent if and only if their symmetric difference is an edge in $G$. Let $G$ be the join graph of $E_n$ and $H$, where $H$ is any graph. In this paper, we give a method to construct an independent set ${\mathcal I}'$ of $F_2(G)$ from an independent set ${\mathcal I}$ of $F_2(G)$ such that $|{\mathcal I}'| \geq |{\mathcal I}|$. As an application, we obtain the independence number of the $2$-token graphs of fan graphs $F_{n, m}$, wheel graphs $W_{n, m}$ and $E_n+K_n$.