Hyperbolic bridged graphs (Q1864582)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hyperbolic bridged graphs |
scientific article |
Statements
Hyperbolic bridged graphs (English)
0 references
18 March 2003
0 references
A connected graph is bridged if it contains no isometric cycles of length more than 3, and it is 1-hyperbolic if for any 4 vertices the largest sum of diagonal distances is at most 1 higher than the second largest. It is shown that a graph satisfies both properties if and only if it does not contain any of 6 specified graphs as an isometric subgraph.
0 references
hyperbolic graphs
0 references
bridged graph
0 references
thin graph
0 references
