Related Experiment Video
Updated: Feb 5, 2026

Traditional Trail Making Test Modified into Brand-new Assessment Tools: Digital and Walking Trail Making Test
Published on: November 23, 2019
Closed trail distance in a biconnected graph
Vaclav Snasel1, Pavla Drazdilova1, Jan Platos1
1Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava, 17. listopadu 15/2172, 708 33 Ostrava, Czech Republic.
Abstract:
Graphs describe and represent many complex structures in the field of social networks, biological, chemical, industrial and transport systems, and others. These graphs are not only connected but often also k-connected (or at least part of them). Different metrics are used to determine the distance between two nodes in the graph. In this article, we propose a novel metric that takes into account the higher degree of connectivity on the part of the graph (for example, biconnected fullerene graphs and fulleroids). Designed metric reflects the cyclical interdependencies among the nodes of the graph. Moreover, a new component model is derived, and the examples of various types of graphs are presented.
Related Concept Videos
Distance Problem
The Distance Formula
Distance Corrections
Ogive Graph
Graphing Antiderivatives
Short-distance Transport of Resources

