On k-edge-magic labelings of maximal outerplanar graphs

From MaRDI portal
Publication:896094

DOI10.1016/J.AKCEJ.2015.06.006zbMATH Open1332.05122arXiv1207.2977OpenAlexW2209026667MaRDI QIDQ896094FDOQ896094


Authors: Gee-Choon Lau, Saeid Alikhani, Sin-Min Lee, William Kocay Edit this on Wikidata


Publication date: 11 December 2015

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Let G be a graph with vertex set V and edge set E such that |V| = p and |E| = q. For integers kgeq 0, define an edge labeling f : E ightarrow {k,k+1,....,k+q-1} and define the vertex sum for a vertex v as the sum of the labels of the edges incident to v. If such an edge labeling induces a vertex labeling in which every vertex has a constant vertex sum (mod p), then G is said to be k-edge magic (k-EM). In this paper, we (i) show that all the maximal outerplanar graphs of order p = 4; 5; 7 are k-EM if and only if kequiv 2 (mod p); (ii) obtain all the maximal outerplanar graphs that are k-EM for k = 3; 4; and (iii) characterize all (p; p-h)-graph that are k-EM for hgeq 0. We conjecture that all maximal outerplanar graphs of prime order p are k-EM if and only if k equiv 2 (mod p).


Full work available at URL: https://arxiv.org/abs/1207.2977




Recommendations




Cites Work


Cited In (3)





This page was built for publication: On \(k\)-edge-magic labelings of maximal outerplanar graphs

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