Search Results for ""

The symbol p^e∥n means, for p a prime, that p^e|n, but p^(e+1)n.

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...

An algebra in which the associator (x,x,x)=0. The subalgebra generated by one element is associative.

P_y(nu)=lim_(T->infty)2/T|int_(-T/2)^(T/2)[y(t)-y^_]e^(-2piinut)dt|^2, (1) so int_0^inftyP_y(nu)dnu = lim_(T->infty)1/Tint_(-T/2)^(T/2)[y(t)-y^_]^2dt (2) = <(y-y^_)^2> (3) = ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...