Search Results for ""

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...

The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...

A complete multipartite graph is a graph that is a complete k-partite graph for some positive integer k (Chartrand and Zhang 2008, p. 41).