A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, Â· Â· Â· , v+e. Such a labeling is vertex magic if the sum ofâ€¦ (More)

A vertex-magic total labeling of a graph G(V; E) is a one-to-one map from E âˆªV onto the integers {1; 2; : : : ; |E| + |V |} such that (x) + âˆ‘ (xy); where the sum is over all vertices y adjacent to x,â€¦ (More)

Triple arrays are a class of designs introduced by Agrawal in 1966 for two-way elimination of heterogeneity in experiments. In this paper we investigate their existence and their connection to otherâ€¦ (More)

Interpretations of orthogonal polynomials in terms of combinatorial models has received a lot of attention over the last decade. Dulucq and Favreau [3] recently presented a combinatorial model forâ€¦ (More)

An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection Î» : V (G)âˆªE(G) â†’ [n+e], where, for every edge uv âˆˆ E(G), we have wtÎ»(uv) = kÎ», the magic sum of Î». Anâ€¦ (More)