On \(k\)-edge-magic labelings of maximal outerplanar graphs (Q896094): Difference between revisions

In this paper it is proven that a maximal outerplanar graph of order \(p= 4, 5\) or \(7\) admits a \(k\)-edge labeling if and only if \(k\equiv 2\pmod{p}\). The authors conjecture that the result can be extended to any maximal outerplanar graph of order \(p\) where \(p\) is a prime.