pone.0202181.g008.tif (65.57 kB)

Path P₁, P₂ between vertices u, v.

figure

posted on 2018-08-31, 17:28 authored by Vaclav Snasel, Pavla Drazdilova, Jan Platos

First graph is biconnected (P₁ ∩ P₂ = {u, v}), second graph is connected with articulation and without bridge (P₁ ∩ P₂ = {u, v, x}) and third graph is connected with bridge (P₁ ∩ P₂ = {u, v, x, (x, v)}).

History

Usage metrics

Keywords

transport systems trail distance component model biconnected fullerene graphs biconnected graph Graphs Different metrics

Licence

CC BY 4.0

Exports

RefWorks

BibTeX

Ref. manager

Endnote

DataCite

NLM

Path P1, P2 between vertices u, v.