3.2 From one Node to A-Node-r

This lesson explores the fundamental concepts of connectivity and distance between nodes in a network. It defines geodesic distance as the shortest path between two nodes and introduces the related terms of neighbors and second neighbors.

Publication Details

Journal
DuEPublico (University of Duisburg-Essen)
Published
2025-10-08
DOI
https://doi.org/10.17185/duepublico/84454
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

3.2 From one Node to A-Node-r

DuEPublico (University of Duisburg-Essen)
Complex Network Analysis Techniques
article

3.2 From one Node to A-Node-r

article en

Abstract

This lesson explores the fundamental concepts of connectivity and distance between nodes in a network. It defines geodesic distance as the shortest path between two nodes and introduces the related terms of neighbors and second neighbors.

DuEPublico (University of Duisburg-Essen)
Openalex Percentile: Top 46%
Complex Network Analysis Techniques
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

3.2 From one Node to A-Node-r · DuEPublico (University of Duisburg-Essen) (2025) | TGRS Research Map | TGRS