Search Results for ""

A point at which two polygon edges of a polygon meet.

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The tritetrahedron, also called the "boat polyhedron," is the name given in this work to the concave (non-regular) octahedron formed by joining three regular tetrahedra ...

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...

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

Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...