Hyperbolic bridged graphs
SCIE
SCOPUS
- Title
- Hyperbolic bridged graphs
- Authors
- Koolen, JH; Moulton, V
- Date Issued
- 2002-08
- Publisher
- Academic Press Ltd
- Abstract
- Given a connected graph G, we take, as usual, the distance xy between any two vertices x, y of G to be the length of some geodesic between x and y. The graph G is said to be delta-hyperbolic, for some 3 : 0, if for all vertices x, y, u, v in G the inequality xy + uv :5 max{xu + yv, xv + yu} + delta holds, and G is bridged if it contains no finite isometric cycles of length four or more. In this paper, we will show that a finite connected bridged graph is 1-hyperbolic if and only if it does not contain any of a list of six graphs as an isometric subgraph. (C) 2002 Elsevier Science Ltd. All rights reserved.
- Keywords
- DISTANCE-HEREDITARY GRAPHS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/27588
- DOI
- 10.1006/EUJC.2002.05
- ISSN
- 0195-6698
- Article Type
- Article
- Citation
- EUROPEAN JOURNAL OF COMBINATORICS, vol. 23, no. 6, page. 683 - 699, 2002-08
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.