id:"swepub:oai:DiVA.org:uu-71822"
Search: id:"swepub:oai:DiVA.org:uu-71822" > Hyperbolic bridged ...
- 1 of 1
- Previous record
- Next record
- To hitlist
Hyperbolic bridged graphs
- Koolen, JH (author)
-
- Moulton, Vincent (author)
- Mittuniversitetet,Uppsala universitet,Centrum för bioinformatik,Institutionen för teknik, fysik och matematik (-2008)
- (creator_code:org_t)
- Elsevier BV, 2002
- 2002
- English.
- In: European Journal of Combinatorics. - : Elsevier BV. - 0195-6698 .- 1095-9971. ; 23:6, s. 683-699
- Journal article (peer-reviewed)
Abstract
Subject headings
Close
- 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.
Keyword
- distance-hereditary graphs
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
- European Journal of Combinatorics (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Koolen, JH
- Moulton, Vincent
- Articles in the publication
- European Journal ...
- By the university
- Uppsala University
- Mid Sweden University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
