On the Connectedness and Diameter of a Geometric Johnson Graph
| Autor: | Eliseo Sarmiento, David Flores-Peñaloza, Ruy Fabila-Monroy, Jorge Urrutia, Javier Cano, Dolores Lara, Crevel Bautista-Santiago, Hernán González-Aguilar |
|---|---|
| Přispěvatelé: | Division de Ciencas Basicas e Ingeniera [Azcapotzalco], Universidad Autonoma Metropolitana-Azcapotzalco, Instituto de Matematicas [México], Universidad Nacional Autónoma de México (UNAM), Centro de Investigacion y de Estudios Avanzados del Instituto Politécnico Nacional (CINVESTAV), Departamento de Matematicas [Mexico], Facultad de Ciencas [Mexico] (UASLP), Universidad Autonoma de San Luis Potosi [México] (UASLP), Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya [Barcelona] (UPC), Escuela Superior de Fisica y Matematicas [Mexico] (ESFM) |
| Předmět: |
Vertex (graph theory)
Discrete mathematics FOS: Computer and information sciences General Computer Science Discrete Mathematics (cs.DM) Voltage graph [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] Distance-regular graph Geometric graph theory Theoretical Computer Science law.invention Combinatorics [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] Graph power law Line graph FOS: Mathematics Discrete Mathematics and Combinatorics Cubic graph Mathematics - Combinatorics Kneser graph Combinatorics (math.CO) Mathematics Computer Science - Discrete Mathematics |
| Zdroj: | Publons Discrete Mathematics and Theoretical Computer Science Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 3 (3), pp.21--30 Eliseo Sarmiento Scopus-Elsevier |
| ISSN: | 1462-7264 1365-8050 |
| Popis: | Combinatorics Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P \C. In this paper we define the generalized island Johnson graph of P as the graph whose vertex consists of all islands of P of cardinality k, two of which are adjacent if their intersection consists of exactly l elements. We show that for large enough values of n, this graph is connected, and give upper and lower bounds on its diameter. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|