Edge-magic trees

From MaRDI portal





A graph \(G=(V,E)\) is edge-magic when there exists a bijection from the vertices and edges of \(G\) to the set of numbers \(\{1,2\ldots, |V|+|E|\}\) such that for each edge, the sum of its label and the labels of its endpoints is a constant. This paper shows that paths and star graphs are edge-magic.











This page was built for publication: Edge-magic trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860738)