Edge irregularity strength conjecture for cycle-star graphs
Statement
Let be a cycle-star graph, where is the cycle order and is the number of leaves. The edge irregularity strength is the least positive integer for which there is a vertex labeling such that the sums of labels on distinct edges are distinct.
Cycle-star edge irregularity strength conjecture. For and ,
This conjecture extends the values established in the paper for smaller cycle lengths, including the cases . Its validity for all is left open by the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.