2019
DOI: 10.48550/arxiv.1909.06698
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The Edge-connectivity of Token Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Fabila-Monroy et al, [15] reintroduced the concept of k-token graph of G as a model in which k indistinguishable tokens move on the vertices of a graph G along the edges of G. They began a systematic study of some combinatorial parameters of F k (G) such as connectivity, diameter, cliques, chromatic number, Hamiltonian paths and Cartesian product. This line of research has been continued by different authors, see, e.g., [5,12,13,16,19,23,24]. In particular Soto et al, [19] showed that a problem in coding theory is equivalent to the study of the packing number of the token graphs of the path graph.…”
mentioning
confidence: 99%
“…Fabila-Monroy et al, [15] reintroduced the concept of k-token graph of G as a model in which k indistinguishable tokens move on the vertices of a graph G along the edges of G. They began a systematic study of some combinatorial parameters of F k (G) such as connectivity, diameter, cliques, chromatic number, Hamiltonian paths and Cartesian product. This line of research has been continued by different authors, see, e.g., [5,12,13,16,19,23,24]. In particular Soto et al, [19] showed that a problem in coding theory is equivalent to the study of the packing number of the token graphs of the path graph.…”
mentioning
confidence: 99%