Search Results for ""

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

The antenna graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["AntennaGraph"].

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...

The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...