Discover published sets by community

Two edges are adjacent if they share a common vertex.

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

A path that starts and ends at the same vertex without traversing any other vertex more than once.

A path in a graph that visits each vertex exactly once.

In a directed graph, a subset of vertices such that there is a directed path from each vertex in the subset to every other vertex.

A connected graph with no cycles.

A path in a graph which visits every edge exactly once.

The number of edges incident to the vertex.

Two graphs G1 and G2 are isomorphic if there is a bijection between their vertex sets that preserves adjacency.

A set of vertices that includes at least one endpoint of every edge in the graph.

A graph in which the edges have a direction.

A square matrix used to represent a finite graph, with rows and columns labeled by graph vertices.

A graph that can be embedded in the plane, so no edges intersect except at their endpoints.

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

A graph in which every pair of vertices is connected by an edge.

A graph whose vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent.

Two vertices are adjacent if they are connected by an edge.

A graph where edges have an associated weight or cost.

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

A matrix that shows the relationship between vertices and edges in a graph.

A set of vertices connected by edges.

A list of degrees of the vertices in the graph, usually written in non-increasing order.

A set of vertices in a graph, no two of which are adjacent.

A collection of trees.