(mathematics) A graph in which there is a route of edges and nodes connecting any two nodes.

plural of graph paper

(graph theory) A graph with vertices but no edges.

(computing) A directed graph that represents relationships between called and calling subroutines in a computer program, used in code analysis.

(mathematics) The complement of a graph hole

(mathematics) A cycle, in a graph, that has no cycle chord

(graph theory) A type of undirected graph in which every biconnected component (block) is a clique.

(mathematics) A bipartite graph associated with an incidence structure.

(graph theory) A graph that associates a weight (usually a real number) with every edge in the graph.

A graph in which a series of connected straight lines connect points, each of which represents the value of a particular variable as a function of another variable.