Conjecture on the super edge-magic total strength of odd-cycle unicyclic graphs

Let G(n;k1,,kn)G(n;k_{1},\dots,k_{n}) be the super edge-magic total unicyclic (p,q)(p,q)-graph consisting of an odd cycle

Cn={a1,a2,,an}C_n=\{a_1,a_2,\dots,a_n\}

and kik_i pendant vertices adjacent to each aia_i, for 1in1\leq i\leq n. Here sm(G)s m(G) denotes the super edge-magic total strength of GG. Super edge-magic total strength conjecture.

sm(G(n;k1,,kn))=2q+n+32.s m(G(n;k_{1},\dots,k_{n}))=2q+\frac{n+3}{2}.

The claim extends the known exact value for the uniform family ki=kk_i=k, while the paper presents computations for certain graphs in this broader family as supporting evidence; its general validity remains open.

Sources & referencesView supporting material

Primary source

Nayana Shibu Deepthi, “Super edge-magic total strength of some unicyclic graphs”, arXiv:2212.05329 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.