2.5 Storing Graphs in Matrices

This lesson explains how to represent network structures mathematically using an adjacency matrix. It demonstrates how this method works for undirected, directed, weighted, and multi-edge graphs.

Publication Details

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

2.5 Storing Graphs in Matrices

DuEPublico (University of Duisburg-Essen)
Graph theory and applications
article

2.5 Storing Graphs in Matrices

article en

Abstract

This lesson explains how to represent network structures mathematically using an adjacency matrix. It demonstrates how this method works for undirected, directed, weighted, and multi-edge graphs.

DuEPublico (University of Duisburg-Essen)
Openalex Percentile: Top 35%
Graph theory and applications
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.

2.5 Storing Graphs in Matrices · DuEPublico (University of Duisburg-Essen) (2025) | TGRS Research Map | TGRS