1736 search results - page 1 / 348 » On antimagic directed graphs |
91
Voted
JGT
2010
14 years 8 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
DM
2006
14 years 10 months ago
2006
A sparse anti-magic square is an n
IPL
2010
14 years 8 months ago
2010
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
INFORMATICALT
2006
14 years 10 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...
COMBINATORICS
2006
14 years 10 months ago
2006
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...