PureOne/friendship-graph-modular-edge-irregularity-proof

Defect Conservation and Exact Modular Edge-Irregularity Strength of Friendship Graphs Public AI-friendly research release · candidate proof · independently verifiable artifacts This repository contains a complete candidate resolution of Open Problem 3.3 from Koam, Ahmad, Bača, and Semaničová-Feňovčíková, AIMS Mathematics 8(1), 2023, concerning the modular edge irregularity strength of friendship graphs. Main candidate theorem For the friendship graph (F_n=K_1\vee… See the full description on the dataset page: https://huggingface.co/datasets/PureOne/friendship-graph-modular-edge-irregularity-proof.