Search Results for ""

A graph for which every node has finite degree.

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

The graph product denoted G-H and defined by the adjacency relations (gadjg^') or (g=g^' and hadjh^'). The graph lexicographic product is also known as the graph composition ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

The rising sun graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RisingSunGraph"].