The week's pick
Reseach Article
On the Automation of the Token Graphs
by
M. K. Christophe Ndjatchi,
David Betancourt Montellano,
Onder Francisco Campos García,
Hugo Pineda Martínez
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 176 - Number 35 |
| Year of Publication: 2020 |
| Authors: M. K. Christophe Ndjatchi, David Betancourt Montellano, Onder Francisco Campos García, Hugo Pineda Martínez |
10.5120/ijca2020920462
|
M. K. Christophe Ndjatchi, David Betancourt Montellano, Onder Francisco Campos García, Hugo Pineda Martínez . On the Automation of the Token Graphs. International Journal of Computer Applications. 176, 35 ( Jul 2020), 49-54. DOI=10.5120/ijca2020920462
@article{
10.5120/ijca2020920462,
author = {
M. K. Christophe Ndjatchi,
David Betancourt Montellano,
Onder Francisco Campos García,
Hugo Pineda Martínez
},
title = { On the Automation of the Token Graphs },
journal = {
International Journal of Computer Applications
},
issue_date = { Jul 2020 },
volume = { 176 },
number = { 35 },
month = { Jul },
year = { 2020 },
issn = { 0975-8887 },
pages = {
49-54
},
numpages = {9},
url = {
https://ijcaonline.org/archives/volume176/number35/31431-2020920462/
},
doi = { 10.5120/ijca2020920462 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:44:18.285752+05:30
%A M. K. Christophe Ndjatchi
%A David Betancourt Montellano
%A Onder Francisco Campos García
%A Hugo Pineda Martínez
%T On the Automation of the Token Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 176
%N 35
%P 49-54
%D 2020
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Let
References
- D. Kornhauser, G. Miller, and P. Spirakis, Coordinating pebble motion on graphs, the diameter of permutations groups, and applications, Proc. 25th IEEE Symposium on Foundations of Computer Science 1 (1984), 241-250.
- Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, and David R. Wood, Token graphs, Graphs Combin. 28 (2012), no. 3, 365-380.
- J. M. Gomez Soto, J. Leaños, L. M. Ríos-Castro, and L. M. Rivera, The packing number of the double vertex graph of the path graph, Discrete Appl. Math. 247 (2018), 327-340, DOI 10.1016/j.dam.2018.03.085. MR3843346
- Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno, On the complexity of reconfiguration problems, Theoret. Comput. Sci. 412 (2011), no. 12-14, 1054-1065.
- Koenraad Audenaert, Chris Godsil, Gordon Royle, and Terry Rudolph, Symmetric squares of graphs, J. Combin. Theory Ser. B 97 (2007), no. 1, 74-90.
- J. Leaños and A. L. Trujillo-Negrete, The connectivity of token graphs, Graphs and combinatorics 34 (2018), 132-138.
- J. Leaños and M. K. Ndjatchi, The Edge-connectivity of Token Graphs, arXiv preprint arXiv: 1909.06698, (2019).
- Wolfram Research, Inc., Mathematica, Version 12.0, Champaign, IL (2019)
- Szabolcs Horvát. (2020, April 3). IGraph/M (Version v0.4).
- Skiena, S. The algorithm design manual. Springer, 2nd ed. (2008), 34-35, 151.
- Kay, S. Intuitive Probability and Random Processes Using MATLAB. Boston, MA: Springer US, (2012), 60.
- Shagnik Das, A brief note on estimates of binomial coefficients, (2016), 2-3.
- Domingos, P. The master algorithm. Basics Books, (2015). 7.
- Fco. Javier Ceballos Sierra, Curso de programación C/C++,(1995), 6.
Index Terms
Computer Science
Information Sciences
Keywords