absorbing An absorbing set $${\displaystyle A}$$ of a directed graph $${\displaystyle G}$$ is a set of vertices such that for any vertex $${\displaystyle v\in G\setminus A}$$, … 展开

DAG Abbreviation for directed acyclic graph, a directed graph without any directed cycles. deck The multiset of graphs formed from a single graph G by deleting a single vertex in … 展开

face In a plane graph or graph embedding, a connected component of the subset of the plane or surface of the embedding that is disjoint from the graph. For an embedding in the … 展开

bag One of the sets of vertices in a tree decomposition. balanced A bipartite or multipartite graph is balanced if each two subsets of its vertex partition have sizes within one of each other. … 展开

C Cn is an n-vertex cycle graph; see cycle. cactus A cactus graph, cactus tree, cactus, or Husimi tree is a connected graph in which each edge belongs to at most one cycle. Its blocks … 展开

E E(G) is the edge set of G; see edge set. ear An ear of a graph is a path whose endpoints may coincide but in which otherwise there are no repetitions of vertices or edges. ear … 展开

G A variable often used to denote a graph. genus The genus of a graph is the minimum genus of a surface onto which it can be embedded; see embedding. geodesic As a noun, a … 展开