Search Results for ""

The Schläfli double sixes graph is the Levi graph of the double sixes configuration.

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

An n-component of a graph G is a maximal n-connected subgraph.

The term in rigidity theory for the edges of a graph.

The number of nodes in a graph is called its order.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...

A distance graph with distance set (0,1].

A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian cycle.