458 search results - page 2 / 92 » Totally magic graphs |
64
Voted
ARSCOM
2007
14 years 11 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
ISMAR
2006
IEEE
15 years 5 months ago
2006
IEEE
In this article we present an interaction tool, based on the Magic Lenses technique, that allows a 3D scene to be affected dynamically given contextual information, for example, t...
87
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
INFORMATICALT
2006
14 years 11 months ago
2006
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
68
Voted
IRI
2007
IEEE
15 years 6 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...