QR koda

Regularity and Planarity of Token Graphs

Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each va...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Principais autores: Carballosa Walter, Fabila-Monroy Ruy, Leaños Jesús, Rivera Luis Manuel
Format: Artigo
Jezik:Inglês
Izdano: University of Zielona Góra 2017-08-01
Serija:Discussiones Mathematicae Graph Theory
Teme:
Online dostop:https://doi.org/10.7151/dmgt.1959
Oznake: Označite
Brez oznak, prvi označite!