Discrete Mathematics & Theoretical Computer Science (Sep 2013)

On the connectedness and diameter of a geometric Johnson graph

Crevel Bautista-Santiago,
Javier Cano,
Ruy Fabila-Monroy,
David Flores-Peñaloza,
Hernàn González-Aguilar,
Dolores Lara,
Eliseo Sarmiento,
Jorge Urrutia

Affiliations

Crevel Bautista-Santiago: Division de Ciencas Basicas e Ingeniera [Azcapotzalco]
Javier Cano: Instituto de Matematicas [México]
Ruy Fabila-Monroy: Centro de Investigacion y de Estudios Avanzados del Instituto Politécnico Nacional
David Flores-Peñaloza: Departamento de Matematicas [Mexico]
Hernàn González-Aguilar: Facultad de Ciencas [Mexico]
Dolores Lara: Departament de Matemàtica Aplicada II
Eliseo Sarmiento: ORCiD; Escuela Superior de Fisica y Matematicas [Mexico]
Jorge Urrutia: Instituto de Matematicas [México]

DOI: https://doi.org/10.46298/dmtcs.613
Journal volume & issue: Vol. Vol. 15 no. 3, no. Combinatorics

Abstract

Combinatorics

[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal