ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=CSk,n−kG=CS_{k,n-k} be a cycle-star graph, where kk is the cycle order and n−kn-k is the number of leaves. The edge irregularity strength es(G)es(G) is the least positive integer ss for which there is a vertex labeling ϕ:V(G)→{1,2,…,s}\phi:V(G)\to\{1,2,\ldots,s\} such that the sums of labels on distinct edges are distinct.

Cycle-star edge irregularity strength conjecture. For k≥8k\geq 8 and n−k≥1n-k\geq 1,

es(G)={⌈n+12⌉for k+1≤n≤2k−4,n−k+2for n≥2k−3.es(G)=\begin{cases} \left\lceil\dfrac{n+1}{2}\right\rceil & \text{for } k+1\leq n\leq 2k-4,\\ n-k+2 & \text{for } n\geq 2k-3. \end{cases}

This conjecture extends the values established in the paper for smaller cycle lengths, including the cases k=7k=7. Its validity for all k≥8k\geq 8 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.