Home › Math & Conversions › Core Math & Algebra › Graph adjacency matrix Adjacency Matrix Calculator for Graphs This interactive tool helps you build and analyze the adjacency matrix of a graph. Choose the number of vertices, toggle directed vs undirected and weighted vs unweighted , edit the matrix or paste an edge list, and get degrees, edge counts, density and adjacency lists. It is designed for students, data scientists and engineers who want a transparent, step-by-step companion to standard graph theory references. Adjacency matrix builder Number of vertices (n) Between 2 and 12 vertices. Graph type Undirected Directed Undirected graphs have symmetric adjacency matrices when unweighted. Weights Unweighted (0/1) Weighted In weighted mode, entries represent edge weights; 0 means no edge. Vertex labels (optional, comma-separated) If empty, vertices are labeled v1, v2, …, vn. Labels are used in adjacency lists and edge parsing. Build

Subcategories in Home › Math & Conversions › Core Math & Algebra › Graph adjacency matrix Adjacency Matrix Calculator for Graphs This interactive tool helps you build and analyze the adjacency matrix of a graph. Choose the number of vertices, toggle directed vs undirected and weighted vs unweighted , edit the matrix or paste an edge list, and get degrees, edge counts, density and adjacency lists. It is designed for students, data scientists and engineers who want a transparent, step-by-step companion to standard graph theory references. Adjacency matrix builder Number of vertices (n) Between 2 and 12 vertices. Graph type Undirected Directed Undirected graphs have symmetric adjacency matrices when unweighted. Weights Unweighted (0/1) Weighted In weighted mode, entries represent edge weights; 0 means no edge. Vertex labels (optional, comma-separated) If empty, vertices are labeled v1, v2, …, vn. Labels are used in adjacency lists and edge parsing. Build.

update matrix Clear matrix Compute graph properties Adjacency matrix A = (a ij ) Rows correspond to source vertices, columns to target vertices. For undirected graphs, entries above the diagonal are mirrored automatically. Edge list (optional, to populate the matrix) Apply edge list to matrix Accepted formats: u v or u-v , separated by commas or new lines. Use your vertex labels or indices (1-based). Graph summary Vertices (n) – Edges (m) – Directed

1 calculators