Search Results for ""

Because of rounding, the stated class limits do not correspond to the actual ranges of data falling in them. For example, if the class limits are 1.00 and 2.00, then all ...

A box-and-whisker plot (sometimes called simply a box plot) is a histogram-like method of displaying data, invented by J. Tukey. To create a box-and-whisker plot, draw a box ...

The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

A tetraview is a visualization technique for bivariate complex functions. In the simplest case, the graph of a complex-valued function w=w(z) can be considered as a ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...