The dimension of a graph
For each graph G the dimension of G is defined as the smallest dimension in the Euclidean Space where there is an embedding in which all the edges of G are segments of a straight line of length one. The exact value is calculated for some important families of graphs and this value is compared with o...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2007 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/136632 |
| Acceso en línea: | https://hdl.handle.net/11441/136632 https://doi.org/10.1016/j.endm.2007.01.031 |
| Access Level: | acceso abierto |
| Palabra clave: | Dimension Graphs Complete graphs Multipartite graphs Invariants |
| Sumario: | For each graph G the dimension of G is defined as the smallest dimension in the Euclidean Space where there is an embedding in which all the edges of G are segments of a straight line of length one. The exact value is calculated for some important families of graphs and this value is compared with other invariants. An infinite quantity of forbidden graphs for dimension 2 is also shown |
|---|