Hyperbolic Bridged Graphs
Copyright policy )Hyperbolic Bridged Graphs
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.
- Mid Sweden University Sweden
- Bielefeld University Germany
- Pohang University of Science and Technology Korea (Republic of)
- University of East Anglia United Kingdom
Distance in graphs, Computational Theory and Mathematics, thin graph, DISTANCE-HEREDITARY GRAPHS, hyperbolic graphs, Structural characterization of families of graphs, bridged graph, Geometry and Topology, Paths and cycles, Theoretical Computer Science
Distance in graphs, Computational Theory and Mathematics, thin graph, DISTANCE-HEREDITARY GRAPHS, hyperbolic graphs, Structural characterization of families of graphs, bridged graph, Geometry and Topology, Paths and cycles, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).39 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!