On the 2-Token Graphs of Some Disjoint Union of Graphs
Y. Susanti,
Abstract:The k-token graph of a given graph G, is the graph which vertex set consists of all k−
subsets of the vertex set of G and two vertices are connected by an edge exactly when their difference corresponds to an edge of G. In this paper, we give a description on the structure of the 2-token graph of disjoint union of multiple graphs. This result complements the previous findings regarding the properties of the k-token graphs.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.