Discover published sets by community

A sequence of vertices where each adjacent pair is connected by an edge.

A square matrix used to represent a finite graph, with the element at row $i$ and column $j$ indicating the presence or absence (and sometimes the weight) of an edge between vertices $i$ and $j$.

A graph in which there is a path between every pair of vertices.

A graph in which the edges have a direction.

A matrix that shows the relationship between vertices and edges, where rows represent vertices and columns represent edges.

A collection of nodes (also called vertices) and edges connecting some or all of them.

A graph in which each edge is assigned a numerical value or weight.

A graph formed from a subset of the vertices and edges of a larger graph.

A path that travels through every edge exactly once.

The number of edges incident to the vertex, with loops counted twice.

A path that starts and ends at the same vertex and contains at least one other vertex; no edges or intermediate vertices are repeated.

A graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex from one set to a vertex from the other set.

A fundamental unit by which graphs are formed, usually represented as a dot or a circle.

A graph in which there is an edge between every pair of vertices.