uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Hyperbolic bridged graphs
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Faculty of Science and Technology, Biology, The Linnaeus Centre for Bioinformatics.
2002 (English)In: European Journal of Combinatorics, ISSN 0195-6698, Vol. 23, no 6, 683-699 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2002. Vol. 23, no 6, 683-699 p.
Keyword [en]
distance-hereditary graphs
URN: urn:nbn:se:uu:diva-71822OAI: oai:DiVA.org:uu-71822DiVA: diva2:99733
Available from: 2005-05-12 Created: 2005-05-12 Last updated: 2011-01-13

Open Access in DiVA

No full text

By organisation
The Linnaeus Centre for Bioinformatics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 160 hits
ReferencesLink to record
Permanent link

Direct link