Search Results for ""

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...

An element admitting a multiplicative or additive inverse. In most cases, the choice between these two options is clear from the context, as, for example, in a monoid, where ...

A Jordan curve is a plane curve which is topologically equivalent to (a homeomorphic image of) the unit circle, i.e., it is simple and closed. It is not known if every Jordan ...

The center of any sphere which has a contact of (at least) first-order with a curve C at a point P lies in the normal plane to C at P. The center of any sphere which has a ...

A ring defined on a singleton set {*}. The ring operations (multiplication and addition) are defined in the only possible way, *·*=*, (1) and *+*=*. (2) It follows that this ...

A variation of chess involving a change in the form of the board, the rules of play, or the pieces used. For example, the normal rules of chess can be used but with a ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...