|
Search: id:A152682
|
|
|
| A152682 |
|
The smallest value of the largest label for which there exists an edge-magic injection of the complete graph K_n on n vertices. |
|
+0
2
|
|
| 1, 3, 6, 11, 15, 21, 32, 46, 64, 86, 110
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
A. Kotzig and A. Rosa. Magic Valuations of Finite Graphs. Canad. Math. Bull. v.13 (1970), pp.451-461.
J. P. McSorley and J. A. Trono. On k-minimum and m-minimum Edge-Magic Injections of Graphs. Preprint, (2008).
W. D. Wallis. Magic Graphs. Birkhauser, (2001). Section 2.10.
|
|
EXAMPLE
|
a(4)=11 because when forming an edge-magic injection of K_4 we must use at least the first 10 natural numbers {1,2,...10}
since K_4 has a total of 10 vertices and edges. However this is not possible. But there is an edge-magic injection
using the set {1,2,....11}\{4}, namely with {1,2,3,5} as the vertex labels.
|
|
CROSSREFS
|
See related sequence A129413 which concerns the smallest value of the magic sum of an edge-magic injection of K_n.
Sequence in context: A056232 A067278 A113960 this_sequence A059753 A131665 A132158
Adjacent sequences: A152679 A152680 A152681 this_sequence A152683 A152684 A152685
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
John P McSorley (mcsorley60(AT)hotmail.com), Dec 10 2008
|
|
|
Search completed in 0.002 seconds
|
