On a question by Erdős about edge-magic graphs (Q1817579): Difference between revisions

A graph with \(p\) vertices and \(q\) edges is edge-magic, if every vertex and edge can be labelled with a distinct number from \(\{1,2,\dots, p+q\}\), such that for every edge, the sum of the label of the edge and the labels of its endpoints is the same. Some general results about edge-magic graphs are given. It is shown that \(K_1\), \(K_2\), \(K_3\), \(K_5\), \(K_6\), and the graph obtained by removing an edge from \(K_4\) are edge-magic, but \(K_4\) or any complete graph with at least seven vertices is not edge-magic.