enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Circulant graph - Wikipedia

    en.wikipedia.org/wiki/Circulant_graph

    Circulant graphs can be described in several equivalent ways: [2] The automorphism group of the graph includes a cyclic subgroup that acts transitively on the graph's vertices. In other words, the graph has an automorphism which is a cyclic permutation of its vertices. The graph has an adjacency matrix that is a circulant matrix.

  3. Circulant matrix - Wikipedia

    en.wikipedia.org/wiki/Circulant_matrix

    In graph theory, a graph or digraph whose adjacency matrix is circulant is called a circulant graph/digraph. Equivalently, a graph is circulant if its automorphism group contains a full-length cycle. The Möbius ladders are examples of circulant graphs, as are the Paley graphs for fields of prime order.

  4. Cycle graph - Wikipedia

    en.wikipedia.org/wiki/Cycle_graph

    A directed cycle graph of length 8. A directed cycle graph is a directed version of a cycle graph, with all the edges being oriented in the same direction. In a directed graph, a set of edges which contains at least one edge (or arc) from each directed cycle is called a feedback arc set.

  5. Circular-arc graph - Wikipedia

    en.wikipedia.org/wiki/Circular-arc_graph

    A circular-arc graph (left) and a corresponding arc model (right). In graph theory, a circular-arc graph is the intersection graph of a set of arcs on the circle. It has one vertex for each arc in the set, and an edge between every pair of vertices corresponding to arcs that intersect.

  6. Pie chart - Wikipedia

    en.wikipedia.org/wiki/Pie_chart

    A pie chart (or a circle chart) is a circular statistical graphic which is divided into slices to illustrate numerical proportion. In a pie chart, the arc length of each slice (and consequently its central angle and area ) is proportional to the quantity it represents.

  7. Circle graph - Wikipedia

    en.wikipedia.org/wiki/Circle_graph

    A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a chord diagram.That is, it is an undirected graph whose vertices can be associated with a finite system of chords of a circle such that two vertices are adjacent if and only if the corresponding chords cross each other.

  8. Hamiltonian path - Wikipedia

    en.wikipedia.org/wiki/Hamiltonian_path

    A graph that contains a Hamiltonian path is called a traceable graph. A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices. A Hamiltonian cycle , Hamiltonian circuit , vertex tour or graph cycle is a cycle that visits each vertex exactly once.

  9. Archimedean spiral - Wikipedia

    en.wikipedia.org/wiki/Archimedean_spiral

    Archimedean spiral represented on a polar graph The Archimedean spiral has the property that any ray from the origin intersects successive turnings of the spiral in points with a constant separation distance (equal to 2 πb if θ is measured in radians ), hence the name "arithmetic spiral".