Conjecture on the super edge-magic total strength of odd-cycle unicyclic graphs
Let be the super edge-magic total unicyclic -graph consisting of an odd cycle
and pendant vertices adjacent to each , for . Here denotes the super edge-magic total strength of . Super edge-magic total strength conjecture.
The claim extends the known exact value for the uniform family , while the paper presents computations for certain graphs in this broader family as supporting evidence; its general validity remains open.
References
- Nayana Shibu Deepthi, “Super edge-magic total strength of some unicyclic graphs”, arXiv:2212.05329 (2022).
Progress summary
The proposed formula is proved only for several special families, and the full conjecture remains open.
The conjecture asserts the stated value of super edge-magic total strength for every odd-cycle unicyclic graph with arbitrary nonnegative pendant counts. The available paper presents its general validity as open.
Known results and June 30, 2024 development
The June 30, 2024 paper proves the formula for the uniform family , for in its stated range, for , and for the specified two-exceptional-vertex family with odd . It describes these results as supporting evidence, not a proof for arbitrary .
Community submission (unverified)
Posted 2026-11-07: A submitted proof argues that has , contradicting the conjectured value . This claim has not been independently corroborated.
Current status (as of November 2026): The conjecture is established for several special families, while the general case remains open; the submitted counterexample is unverified.
Sources
Solutions 1
Exact super edge-magic total strength of a seven-cycle with four leaves at one vertexSee full solution
Result and scope. G(7;0,0,0,0,0,0,4) has an SEMT labeling with constant 26 (and sm=26 exactly by an ordinary degree-rearrangement bound), contradicting Deepthi Conjecture 1 sm(G(n;k_1..k_n)) = 2q+(n+3)/2 = 27 on its nonnegative leaf-count domain.
Complete proof: Exact super edge-magic total strength of a seven-cycle with four leaves at one vertex · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.