Hyperbolic bridged graphs (Q1864582)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1884154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hyperbolic bridged graphs |
scientific article; zbMATH DE number 1884154 |
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
0.816383421421051
0 references
0.8035370707511902
0 references
0.7962884306907654
0 references
0.7786278128623962
0 references
0.7686501145362854
0 references
