Super edge-magic strength of fire crackers, banana trees and unicyclic graphs (Q2497529): Difference between revisions

A graph \(G(V,E)\) is super edge-magic if it has a labeling \(f\) of its vertices and edges using the numbers \(1,2, \ldots , | V| +| E| \) such that \(f(V)= \{ 1, 2, \dots ,| V| \}\) and, for any \(uv \in E\), \(f(u)+ f(v)+f(uv)\) is a constant \(c(f)\). The super edge-magic strength of such a graph is the minimum \(c(f)\) over all super edge-magic labelings \(f\) of \(G\). The authors obtain bounds on the super edge-magic strength for the following graphs \(G\): stars joined by a path, stars joined to a vertex, and graphs with one cycle.