Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Distance Problem01:29

Distance Problem

71
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
71
The Distance Formula01:20

The Distance Formula

652
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
652
Distance Corrections01:15

Distance Corrections

293
To achieve precise distance measurements, especially in surveying and construction, certain corrections must be applied to account for potential sources of error like the standardization errors, temperature variations, and slope adjustments.Standardization error emerges when measurement equipment undergoes changes, such as wear, repairs, or weather impacts. To address this, surveyors compare the equipment’s readings to a standard. This process identifies any deviation that might lead to...
293
Ogive Graph01:07

Ogive Graph

6.8K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
6.8K
Graphing Antiderivatives01:30

Graphing Antiderivatives

72
The concept of an antiderivative is fundamental in calculus, describing how a function's values accumulate over time. This process is closely related to physical motion, such as the movement of a rolling ball. As the ball progresses, its position changes in response to variations in velocity, just as an antiderivative graph reflects the cumulative effect of the original function's values.Graphing an antiderivative requires interpreting how a function's values influence the shape of its...
72
Short-distance Transport of Resources02:12

Short-distance Transport of Resources

17.7K
Short-distance transport refers to transport that occurs over a distance of just 2-3 cells, crossing the plasma membrane in the process. Small uncharged molecules, such as oxygen, carbon dioxide, and water, can diffuse across the plasma membrane on their own. In contrast, ions and larger molecules require the assistance of transport proteins due to their charge or size. Transport across membranes also occurs within individual cells, playing a variety of essential roles for the plant as a whole.
17.7K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Comparison study of population-based methods for non-invasive fetal electrocardiography extraction.

Frontiers in medicine·2026
Same author

Hyperbolic topological data analysis mapper reveals dynamic trait-environment patterns in plant phenomics.

Plant phenomics (Washington, D.C.)·2026
Same author

Leveraging Feature Alignment in Grassmannian Manifold for Multi-Output Regression Tasks.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Video-based hand gesture recognition via SPD manifold spatial representation and optical flow motion features.

PloS one·2026
Same author

Multiscale SPD manifold learning for rehabilitation exercise evaluation.

Scientific reports·2025
Same author

Enhancing cardiotocography classification via ensemble learning and threshold optimization.

Scientific reports·2025

Related Experiment Video

Updated: Feb 5, 2026

Traditional Trail Making Test Modified into Brand-new Assessment Tools: Digital and Walking Trail Making Test
08:07

Traditional Trail Making Test Modified into Brand-new Assessment Tools: Digital and Walking Trail Making Test

Published on: November 23, 2019

11.8K

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.

Plos One
|September 1, 2018
PubMed
Summary

This study introduces a new graph metric to measure node distance, considering higher connectivity in complex networks like fullerene graphs. The metric captures cyclical interdependencies, offering a novel approach to graph analysis.

More Related Videos

Experimental Paradigm for Measuring the Effects of Self-distancing in Young Children
07:01

Experimental Paradigm for Measuring the Effects of Self-distancing in Young Children

Published on: March 1, 2019

8.5K
Quantifying Intermembrane Distances with Serial Image Dilations
07:45

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

6.7K

Related Experiment Videos

Last Updated: Feb 5, 2026

Traditional Trail Making Test Modified into Brand-new Assessment Tools: Digital and Walking Trail Making Test
08:07

Traditional Trail Making Test Modified into Brand-new Assessment Tools: Digital and Walking Trail Making Test

Published on: November 23, 2019

11.8K
Experimental Paradigm for Measuring the Effects of Self-distancing in Young Children
07:01

Experimental Paradigm for Measuring the Effects of Self-distancing in Young Children

Published on: March 1, 2019

8.5K
Quantifying Intermembrane Distances with Serial Image Dilations
07:45

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

6.7K

Area of Science:

  • Graph theory
  • Network analysis
  • Computational chemistry

Background:

  • Graphs are fundamental to representing complex systems like social networks and chemical structures.
  • Existing distance metrics in graphs do not fully capture higher-order connectivity.
  • K-connectivity is a crucial property in many real-world networks.

Purpose of the Study:

  • To propose a novel graph metric for calculating node distances.
  • To account for increased connectivity, particularly in k-connected subgraphs.
  • To reflect cyclical interdependencies within graph components.

Main Methods:

  • Development of a new distance metric for graphs.
  • Derivation of a new component model for graph analysis.
  • Application and illustration of the metric on various graph types, including fullerene graphs.

Main Results:

  • A novel metric accurately reflects cyclical interdependencies in highly connected graphs.
  • The proposed component model provides new insights into graph structures.
  • Demonstrated applicability across diverse graph examples.

Conclusions:

  • The new metric enhances graph analysis by incorporating higher connectivity.
  • This approach is valuable for understanding complex systems with cyclical relationships.
  • The findings contribute to the field of network science and graph theory.