3 research outputs found
Super edge-magic total strength of some unicyclic graphs
Let be a finite simple undirected -graph, with vertex set
and edge set such that and . A super edge-magic
total labeling of is a bijection such that for all edges , , where is called a magic constant, and . The minimum of all , where the minimum is taken over all the super
edge-magic total labelings of , is defined to be the super edge-magic
total strength of the graph . In this article, we work on certain classes of
unicyclic graphs and provide shreds of evidence to conjecture that the super
edge-magic total strength of a certain family of unicyclic -graphs is
equal to