On the 2-token graph of a graph
Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
Saved in:
Published in | AKCE international journal of graphs and combinatorics Vol. ahead-of-print; no. ahead-of-print; pp. 1 - 4 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Taylor & Francis
02.01.2020
Taylor & Francis Group |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Let
be a graph and let
be a positive integer. Let
=
and
. The
-token graph
is the graph with vertex set
and two vertices
and
are adjacent if
and
, where
denotes the symmetric difference. In this paper we present several basic results on 2-token graphs. |
---|---|
ISSN: | 0972-8600 2543-3474 |
DOI: | 10.1016/j.akcej.2019.05.002 |