On the Connectedness and Diameter of a Geometric Johnson Graph

zbMath1283.05147arXiv1202.3455MaRDI QIDQ5747405

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

Publication date: 14 February 2014

Full work available at URL: https://arxiv.org/abs/1202.3455

zbMATH Keywords

connectednessJohnson graphintersection graphdiameterislands

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

Related Items (4)

The equidistant dimension of graphs ⋮ Carathéodory's theorem in depth ⋮ Computing balanced islands in two colored point sets in the plane ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs

This page was built for publication: On the Connectedness and Diameter of a Geometric Johnson Graph