The Diameter of undirected graphs associated to plane tessellations
Thi s paper studi es the di ameter of sorne fami I i es of undirected graphs that can be associated to plane tessel lations which fu1 ly represent them. More precisely, we concentrate upon maximizing the order of the graphs for given values of their diameter and degree, where the study always leads...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1985 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/12662 |
| Acceso en línea: | https://hdl.handle.net/2117/12662 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory Group theory Teoria de grafs Classificació AMS::05 Combinatorics::05C Graph theory Classificació AMS::20 Group theory and generalizations Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups |
| Sumario: | Thi s paper studi es the di ameter of sorne fami I i es of undirected graphs that can be associated to plane tessel lations which fu1 ly represent them. More precisely, we concentrate upon maximizing the order of the graphs for given values of their diameter and degree, where the study always leads to the optima'l solutions. |
|---|