Search Results for ""

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...

If S is any nonempty partially ordered set in which every chain has an upper bound, then S has a maximal element. This statement is equivalent to the axiom of choice. Renteln ...