Search Results for ""

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A node which is one graph edge further away from a given node in a rooted tree.

A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific ...

The graph corresponding to the complete k-ary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, k].

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...